Determination of transition from non-singular matrix to singular matrix
I have the following matrix as a biproduct of inverting a matrix sum by the Woodbury matrix identity:
$$ mathbf{A} = -(gmathbf{G})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} $$
where $g$ is an arbitrary but positive scalar, $mathbf{G}$ is a $mtimes m$ diagonal matrix with positive entities, $mathbf{W}$ is an $n times m$ array with each column having a single $1$ or $-1$ entity and otherwise zeros and $mathbf{K}$ is a $n times n$ symmetric, real and positive definite matrix, representing the stiffness matrix of an elastic solid. Further more $m << n$, typically $10^4<n$ and $m < 20$.
$mathbf{K}$ has a structure such that for very small values of $g$ $mathbf{A}$ will be positive definite. When increasing $g$ towards $g_0$ ($0<gleq g_0$) the matrix $mathbf{A}$ will at some point become singular and the system loses its stability. I am to determine $g_0$ which indentifies instability.
I am trying to set up a robust way to determine $mathbf{A}$'s transition from non-singular to singular. Right now I am calculating the determinant of $mathbf{A}$ with Matlab, and it seems that as $mathbf{A}$ becomes 'less and less' positive definite, the determinant decreases and becomes $0$ when singular. For $g_0<g$ it seems that the determinant becomes negative, which I guess is a result of $mathbf{A}$ then being negative definite?
Is it correct that as $g rightarrow infty$ $mathbf{A}$ goes from being positive definite to singular to negative definite along with the determinant going from positive through $0$ to negative with $det(mathbf{A})=0$ identifying the point when $mathbf{A}$ becomes singular? Is there a precise mathematical argument for the determinant to behave in that way?
Thanks for any comments.
linear-algebra matrices determinant singularity
New contributor
add a comment |
I have the following matrix as a biproduct of inverting a matrix sum by the Woodbury matrix identity:
$$ mathbf{A} = -(gmathbf{G})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} $$
where $g$ is an arbitrary but positive scalar, $mathbf{G}$ is a $mtimes m$ diagonal matrix with positive entities, $mathbf{W}$ is an $n times m$ array with each column having a single $1$ or $-1$ entity and otherwise zeros and $mathbf{K}$ is a $n times n$ symmetric, real and positive definite matrix, representing the stiffness matrix of an elastic solid. Further more $m << n$, typically $10^4<n$ and $m < 20$.
$mathbf{K}$ has a structure such that for very small values of $g$ $mathbf{A}$ will be positive definite. When increasing $g$ towards $g_0$ ($0<gleq g_0$) the matrix $mathbf{A}$ will at some point become singular and the system loses its stability. I am to determine $g_0$ which indentifies instability.
I am trying to set up a robust way to determine $mathbf{A}$'s transition from non-singular to singular. Right now I am calculating the determinant of $mathbf{A}$ with Matlab, and it seems that as $mathbf{A}$ becomes 'less and less' positive definite, the determinant decreases and becomes $0$ when singular. For $g_0<g$ it seems that the determinant becomes negative, which I guess is a result of $mathbf{A}$ then being negative definite?
Is it correct that as $g rightarrow infty$ $mathbf{A}$ goes from being positive definite to singular to negative definite along with the determinant going from positive through $0$ to negative with $det(mathbf{A})=0$ identifying the point when $mathbf{A}$ becomes singular? Is there a precise mathematical argument for the determinant to behave in that way?
Thanks for any comments.
linear-algebra matrices determinant singularity
New contributor
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago
add a comment |
I have the following matrix as a biproduct of inverting a matrix sum by the Woodbury matrix identity:
$$ mathbf{A} = -(gmathbf{G})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} $$
where $g$ is an arbitrary but positive scalar, $mathbf{G}$ is a $mtimes m$ diagonal matrix with positive entities, $mathbf{W}$ is an $n times m$ array with each column having a single $1$ or $-1$ entity and otherwise zeros and $mathbf{K}$ is a $n times n$ symmetric, real and positive definite matrix, representing the stiffness matrix of an elastic solid. Further more $m << n$, typically $10^4<n$ and $m < 20$.
$mathbf{K}$ has a structure such that for very small values of $g$ $mathbf{A}$ will be positive definite. When increasing $g$ towards $g_0$ ($0<gleq g_0$) the matrix $mathbf{A}$ will at some point become singular and the system loses its stability. I am to determine $g_0$ which indentifies instability.
I am trying to set up a robust way to determine $mathbf{A}$'s transition from non-singular to singular. Right now I am calculating the determinant of $mathbf{A}$ with Matlab, and it seems that as $mathbf{A}$ becomes 'less and less' positive definite, the determinant decreases and becomes $0$ when singular. For $g_0<g$ it seems that the determinant becomes negative, which I guess is a result of $mathbf{A}$ then being negative definite?
Is it correct that as $g rightarrow infty$ $mathbf{A}$ goes from being positive definite to singular to negative definite along with the determinant going from positive through $0$ to negative with $det(mathbf{A})=0$ identifying the point when $mathbf{A}$ becomes singular? Is there a precise mathematical argument for the determinant to behave in that way?
Thanks for any comments.
linear-algebra matrices determinant singularity
New contributor
I have the following matrix as a biproduct of inverting a matrix sum by the Woodbury matrix identity:
$$ mathbf{A} = -(gmathbf{G})^{-1} + mathbf{W}^T mathbf{K}^{-1} mathbf{W} $$
where $g$ is an arbitrary but positive scalar, $mathbf{G}$ is a $mtimes m$ diagonal matrix with positive entities, $mathbf{W}$ is an $n times m$ array with each column having a single $1$ or $-1$ entity and otherwise zeros and $mathbf{K}$ is a $n times n$ symmetric, real and positive definite matrix, representing the stiffness matrix of an elastic solid. Further more $m << n$, typically $10^4<n$ and $m < 20$.
$mathbf{K}$ has a structure such that for very small values of $g$ $mathbf{A}$ will be positive definite. When increasing $g$ towards $g_0$ ($0<gleq g_0$) the matrix $mathbf{A}$ will at some point become singular and the system loses its stability. I am to determine $g_0$ which indentifies instability.
I am trying to set up a robust way to determine $mathbf{A}$'s transition from non-singular to singular. Right now I am calculating the determinant of $mathbf{A}$ with Matlab, and it seems that as $mathbf{A}$ becomes 'less and less' positive definite, the determinant decreases and becomes $0$ when singular. For $g_0<g$ it seems that the determinant becomes negative, which I guess is a result of $mathbf{A}$ then being negative definite?
Is it correct that as $g rightarrow infty$ $mathbf{A}$ goes from being positive definite to singular to negative definite along with the determinant going from positive through $0$ to negative with $det(mathbf{A})=0$ identifying the point when $mathbf{A}$ becomes singular? Is there a precise mathematical argument for the determinant to behave in that way?
Thanks for any comments.
linear-algebra matrices determinant singularity
linear-algebra matrices determinant singularity
New contributor
New contributor
New contributor
asked 5 hours ago
DavidH
1
1
New contributor
New contributor
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago
add a comment |
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago
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
});
}
});
DavidH is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3060364%2fdetermination-of-transition-from-non-singular-matrix-to-singular-matrix%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
DavidH is a new contributor. Be nice, and check out our Code of Conduct.
DavidH is a new contributor. Be nice, and check out our Code of Conduct.
DavidH is a new contributor. Be nice, and check out our Code of Conduct.
DavidH is a new contributor. Be nice, and check out our Code of Conduct.
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3060364%2fdetermination-of-transition-from-non-singular-matrix-to-singular-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
Look at the corner case: $W=G=I_2$ and $K = a,I_2$. The determinant is always positive or null.
– Damien
3 hours ago