Definiteness of matrix after Woodbury inversion.
$begingroup$
Consider a real, symmetric and positive definite $ntimes n$ matrix $mathbf{K}$, and a $ntimes m$ matrix $mathbf{W}$. $mathbf{W}$ contains $m$ columns with all zeros except a single entry in each column which is 1. Furthermore $(gmathbf{B})$ is a $m times m$ diagonal matrix with positive diagonal elements and $g<0$. Thus, $(gmathbf{B})$ is negative definite.
With $g rightarrow -infty$ I am trying to figure out when the following matrix becomes singular
$$
mathbf{K}^* = mathbf{K} + mathbf{W}(gmathbf{B})mathbf{W}^{T}
$$
The matrix is large and I don't want to calculate e.g. the lowest eigenvalue of the matrix. Instead I'm looking at when the matrix is invertible, thus by the Woodury formula I get
$$
{mathbf{K}^*}^{-1} = mathbf{K}^{-1} - mathbf{K}^{-1} mathbf{W} big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]^{-1} mathbf{W}^T mathbf{K}^{-1}
$$
And I am assuming that the $m times m$ matrix in the brackets equally must be invertible in order for $mathbf{K}^*$ to be invertible. However, I seem to be wrong in this assumption as $mathbf{K}^*$ becomes singular at a different value of $g$ than $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$, so:
- Can I relate the definiteness of $mathbf{K}^*$ to the definiteness of $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$ as $g rightarrow -infty$?
- Can I say anything about when $mathbf{K}^*$ becomes singular based on $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$?
- Any other suggestions on how to determine the point of singularity of $mathbf{K}^*$ other than brute force are welcome.
linear-algebra matrices positive-definite singularity
$endgroup$
add a comment |
$begingroup$
Consider a real, symmetric and positive definite $ntimes n$ matrix $mathbf{K}$, and a $ntimes m$ matrix $mathbf{W}$. $mathbf{W}$ contains $m$ columns with all zeros except a single entry in each column which is 1. Furthermore $(gmathbf{B})$ is a $m times m$ diagonal matrix with positive diagonal elements and $g<0$. Thus, $(gmathbf{B})$ is negative definite.
With $g rightarrow -infty$ I am trying to figure out when the following matrix becomes singular
$$
mathbf{K}^* = mathbf{K} + mathbf{W}(gmathbf{B})mathbf{W}^{T}
$$
The matrix is large and I don't want to calculate e.g. the lowest eigenvalue of the matrix. Instead I'm looking at when the matrix is invertible, thus by the Woodury formula I get
$$
{mathbf{K}^*}^{-1} = mathbf{K}^{-1} - mathbf{K}^{-1} mathbf{W} big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]^{-1} mathbf{W}^T mathbf{K}^{-1}
$$
And I am assuming that the $m times m$ matrix in the brackets equally must be invertible in order for $mathbf{K}^*$ to be invertible. However, I seem to be wrong in this assumption as $mathbf{K}^*$ becomes singular at a different value of $g$ than $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$, so:
- Can I relate the definiteness of $mathbf{K}^*$ to the definiteness of $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$ as $g rightarrow -infty$?
- Can I say anything about when $mathbf{K}^*$ becomes singular based on $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$?
- Any other suggestions on how to determine the point of singularity of $mathbf{K}^*$ other than brute force are welcome.
linear-algebra matrices positive-definite singularity
$endgroup$
$begingroup$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22
add a comment |
$begingroup$
Consider a real, symmetric and positive definite $ntimes n$ matrix $mathbf{K}$, and a $ntimes m$ matrix $mathbf{W}$. $mathbf{W}$ contains $m$ columns with all zeros except a single entry in each column which is 1. Furthermore $(gmathbf{B})$ is a $m times m$ diagonal matrix with positive diagonal elements and $g<0$. Thus, $(gmathbf{B})$ is negative definite.
With $g rightarrow -infty$ I am trying to figure out when the following matrix becomes singular
$$
mathbf{K}^* = mathbf{K} + mathbf{W}(gmathbf{B})mathbf{W}^{T}
$$
The matrix is large and I don't want to calculate e.g. the lowest eigenvalue of the matrix. Instead I'm looking at when the matrix is invertible, thus by the Woodury formula I get
$$
{mathbf{K}^*}^{-1} = mathbf{K}^{-1} - mathbf{K}^{-1} mathbf{W} big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]^{-1} mathbf{W}^T mathbf{K}^{-1}
$$
And I am assuming that the $m times m$ matrix in the brackets equally must be invertible in order for $mathbf{K}^*$ to be invertible. However, I seem to be wrong in this assumption as $mathbf{K}^*$ becomes singular at a different value of $g$ than $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$, so:
- Can I relate the definiteness of $mathbf{K}^*$ to the definiteness of $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$ as $g rightarrow -infty$?
- Can I say anything about when $mathbf{K}^*$ becomes singular based on $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$?
- Any other suggestions on how to determine the point of singularity of $mathbf{K}^*$ other than brute force are welcome.
linear-algebra matrices positive-definite singularity
$endgroup$
Consider a real, symmetric and positive definite $ntimes n$ matrix $mathbf{K}$, and a $ntimes m$ matrix $mathbf{W}$. $mathbf{W}$ contains $m$ columns with all zeros except a single entry in each column which is 1. Furthermore $(gmathbf{B})$ is a $m times m$ diagonal matrix with positive diagonal elements and $g<0$. Thus, $(gmathbf{B})$ is negative definite.
With $g rightarrow -infty$ I am trying to figure out when the following matrix becomes singular
$$
mathbf{K}^* = mathbf{K} + mathbf{W}(gmathbf{B})mathbf{W}^{T}
$$
The matrix is large and I don't want to calculate e.g. the lowest eigenvalue of the matrix. Instead I'm looking at when the matrix is invertible, thus by the Woodury formula I get
$$
{mathbf{K}^*}^{-1} = mathbf{K}^{-1} - mathbf{K}^{-1} mathbf{W} big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]^{-1} mathbf{W}^T mathbf{K}^{-1}
$$
And I am assuming that the $m times m$ matrix in the brackets equally must be invertible in order for $mathbf{K}^*$ to be invertible. However, I seem to be wrong in this assumption as $mathbf{K}^*$ becomes singular at a different value of $g$ than $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$, so:
- Can I relate the definiteness of $mathbf{K}^*$ to the definiteness of $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$ as $g rightarrow -infty$?
- Can I say anything about when $mathbf{K}^*$ becomes singular based on $big[ (gmathbf{B})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} big]$?
- Any other suggestions on how to determine the point of singularity of $mathbf{K}^*$ other than brute force are welcome.
linear-algebra matrices positive-definite singularity
linear-algebra matrices positive-definite singularity
edited Jan 14 at 12:32
DavidH
asked Jan 14 at 12:12
DavidHDavidH
134
134
$begingroup$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22
add a comment |
$begingroup$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22
$begingroup$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22
$begingroup$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3073170%2fdefiniteness-of-matrix-after-woodbury-inversion%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3073170%2fdefiniteness-of-matrix-after-woodbury-inversion%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$
"And I am assuming that the m×m matrix in the brackets equally must be invertible in order for K∗ to be invertible." Indeed, you are: addition does horrible things to invertibility: in particular, $K^*$ is invertible when the thing in the brackets is zero. As $gto-infty$, $(gB)^{-1}to0$, so you're really trying to relate the definiteness of $K^*$ and W^TK^{-1}W$. Singularity is probably a stretch: it's a sensitive condition, so a small perturbation would change matters entirely.
$endgroup$
– user3482749
Jan 14 at 12:22