Inverse of strictly diagonally dominant matrix
$begingroup$
I have a matrix whose diagonal entries are positive whereas non-diagonal entries are negative.This matrix is also Strictly diagonally dominant.
Can we say that all elements of the inverse of this matrix is strictly positive i.e $a_{ij}$>0 .
linear-algebra matrices
$endgroup$
add a comment |
$begingroup$
I have a matrix whose diagonal entries are positive whereas non-diagonal entries are negative.This matrix is also Strictly diagonally dominant.
Can we say that all elements of the inverse of this matrix is strictly positive i.e $a_{ij}$>0 .
linear-algebra matrices
$endgroup$
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41
add a comment |
$begingroup$
I have a matrix whose diagonal entries are positive whereas non-diagonal entries are negative.This matrix is also Strictly diagonally dominant.
Can we say that all elements of the inverse of this matrix is strictly positive i.e $a_{ij}$>0 .
linear-algebra matrices
$endgroup$
I have a matrix whose diagonal entries are positive whereas non-diagonal entries are negative.This matrix is also Strictly diagonally dominant.
Can we say that all elements of the inverse of this matrix is strictly positive i.e $a_{ij}$>0 .
linear-algebra matrices
linear-algebra matrices
edited Dec 30 '18 at 4:32
Ayush Mishra
asked Dec 30 '18 at 4:08
Ayush MishraAyush Mishra
485
485
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41
add a comment |
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes. Scale $A$ by a positive factor and we may assume that $max_ia_{ii}<1$. Then $B:=I-A$ is positive and
$$
sum_j|b_{ij}|
=|b_{ii}|+sum_{jne i}|b_{ij}|
=1-a_{ii}+sum_{jne i}|a_{ij}|
<1
$$
for each $i$. Hence $|B|_infty<1$ and we may expand $A^{-1}=(I-B)^{-1}$ as an infinite sum $I+B+B^2+ldots$. However, as $B$ is positive, the infinite sum is positive too.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3056491%2finverse-of-strictly-diagonally-dominant-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Yes. Scale $A$ by a positive factor and we may assume that $max_ia_{ii}<1$. Then $B:=I-A$ is positive and
$$
sum_j|b_{ij}|
=|b_{ii}|+sum_{jne i}|b_{ij}|
=1-a_{ii}+sum_{jne i}|a_{ij}|
<1
$$
for each $i$. Hence $|B|_infty<1$ and we may expand $A^{-1}=(I-B)^{-1}$ as an infinite sum $I+B+B^2+ldots$. However, as $B$ is positive, the infinite sum is positive too.
$endgroup$
add a comment |
$begingroup$
Yes. Scale $A$ by a positive factor and we may assume that $max_ia_{ii}<1$. Then $B:=I-A$ is positive and
$$
sum_j|b_{ij}|
=|b_{ii}|+sum_{jne i}|b_{ij}|
=1-a_{ii}+sum_{jne i}|a_{ij}|
<1
$$
for each $i$. Hence $|B|_infty<1$ and we may expand $A^{-1}=(I-B)^{-1}$ as an infinite sum $I+B+B^2+ldots$. However, as $B$ is positive, the infinite sum is positive too.
$endgroup$
add a comment |
$begingroup$
Yes. Scale $A$ by a positive factor and we may assume that $max_ia_{ii}<1$. Then $B:=I-A$ is positive and
$$
sum_j|b_{ij}|
=|b_{ii}|+sum_{jne i}|b_{ij}|
=1-a_{ii}+sum_{jne i}|a_{ij}|
<1
$$
for each $i$. Hence $|B|_infty<1$ and we may expand $A^{-1}=(I-B)^{-1}$ as an infinite sum $I+B+B^2+ldots$. However, as $B$ is positive, the infinite sum is positive too.
$endgroup$
Yes. Scale $A$ by a positive factor and we may assume that $max_ia_{ii}<1$. Then $B:=I-A$ is positive and
$$
sum_j|b_{ij}|
=|b_{ii}|+sum_{jne i}|b_{ij}|
=1-a_{ii}+sum_{jne i}|a_{ij}|
<1
$$
for each $i$. Hence $|B|_infty<1$ and we may expand $A^{-1}=(I-B)^{-1}$ as an infinite sum $I+B+B^2+ldots$. However, as $B$ is positive, the infinite sum is positive too.
answered Dec 30 '18 at 5:28
user1551user1551
74.4k566129
74.4k566129
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3056491%2finverse-of-strictly-diagonally-dominant-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
See en.wikipedia.org/wiki/M-matrix where it is said in the 3 first lines that it is a known result (but without proof)
$endgroup$
– Jean Marie
Dec 30 '18 at 18:41