Why do real positive eigenvalues result in an unstable system? What about eigenvalues between 0 and 1? or 1? ...
Multiple fireplaces in an apartment building?
How to have a sharp product image?
Obeylines and gappto from etoolbox
Check if a string is entirely made of the same substring
Intern got a job offer for same salary than a long term team member
Co-worker works way more than he should
Philosophical question on logistic regression: why isn't the optimal threshold value trained?
Can a level 2 Warlock take one level in rogue, then continue advancing as a warlock?
How do I check if a string is entirely made of the same substring?
Are there moral objections to a life motivated purely by money? How to sway a person from this lifestyle?
A strange hotel
Map material from china not allowed to leave the country
Why didn't the Space Shuttle bounce back into space as many times as possible so as to lose a lot of kinetic energy up there?
Is Diceware more secure than a long passphrase?
Double-nominative constructions and “von”
Was Dennis Ritchie being too modest in this quote about C and Pascal?
`microtype`: Set Minimum Width of a Space
The weakest link
Is Electric Central Heating worth it if using Solar Panels?
How do I prove this combinatorial identity
Will I lose my paid in full property
What is purpose of DB Browser(dbbrowser.aspx) under admin tool?
How to find if a column is referenced in a computed column?
What is the term for a person whose job is to place products on shelves in stores?
Why do real positive eigenvalues result in an unstable system? What about eigenvalues between 0 and 1? or 1?
Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar ManaraClassifying local behavior of fixed points using eigenvalues from linear stability analysis of 3D systemUse of Routh-Hurwitz if you have the eigenvalues?Dynamics of a three dimensional systemWhat to call the eigenvalues that don't correspond to a conserved quantityDetermining the stability of a system with a zero eigenvalueStability of zero solution of ODE system when largest real part of eigenvalues is $0$.Stable limit cycleFixed point stability of non-linear ode systemNumerically determine eigenvalues of real non-symmetric matrix known to have positive eigenvaluesHow to rotate a coordinate system to find the unstable manifold.
$begingroup$
I'm confused why, if all eigenvalues of a linear system are real and positive, this entails an unstable system. For example, if eigenvalues are between 0 and 1, surely this means the system is gradually shrinking? And even more so, doesn't an eigenvalue of 1 mean the system is "staying put"? Why is a negative eigenvalue instead related to stability?
I'm confused because in the case of eigenvalues of a Markov matrix, it seemed an eigenvalue of 1 meant stability, and 0 < λ < 1 meant it was shrinking. But in both those cases the eigenvalue is positive.
linear-algebra eigenvalues-eigenvectors dynamical-systems stability-theory
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm confused why, if all eigenvalues of a linear system are real and positive, this entails an unstable system. For example, if eigenvalues are between 0 and 1, surely this means the system is gradually shrinking? And even more so, doesn't an eigenvalue of 1 mean the system is "staying put"? Why is a negative eigenvalue instead related to stability?
I'm confused because in the case of eigenvalues of a Markov matrix, it seemed an eigenvalue of 1 meant stability, and 0 < λ < 1 meant it was shrinking. But in both those cases the eigenvalue is positive.
linear-algebra eigenvalues-eigenvectors dynamical-systems stability-theory
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm confused why, if all eigenvalues of a linear system are real and positive, this entails an unstable system. For example, if eigenvalues are between 0 and 1, surely this means the system is gradually shrinking? And even more so, doesn't an eigenvalue of 1 mean the system is "staying put"? Why is a negative eigenvalue instead related to stability?
I'm confused because in the case of eigenvalues of a Markov matrix, it seemed an eigenvalue of 1 meant stability, and 0 < λ < 1 meant it was shrinking. But in both those cases the eigenvalue is positive.
linear-algebra eigenvalues-eigenvectors dynamical-systems stability-theory
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm confused why, if all eigenvalues of a linear system are real and positive, this entails an unstable system. For example, if eigenvalues are between 0 and 1, surely this means the system is gradually shrinking? And even more so, doesn't an eigenvalue of 1 mean the system is "staying put"? Why is a negative eigenvalue instead related to stability?
I'm confused because in the case of eigenvalues of a Markov matrix, it seemed an eigenvalue of 1 meant stability, and 0 < λ < 1 meant it was shrinking. But in both those cases the eigenvalue is positive.
linear-algebra eigenvalues-eigenvectors dynamical-systems stability-theory
linear-algebra eigenvalues-eigenvectors dynamical-systems stability-theory
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 17 mins ago
northerlywind
asked 1 hour ago
northerlywindnortherlywind
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 1 hour ago
northerlywindnortherlywind
355
asked 1 hour ago
northerlywindnortherlywind
355
355
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
northerlywind is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The key difference lies in the fact that the maps defined by a Markov matrix are discrete-time whereas the dynamical systems you refer to are continuous-time systems. In either case, a "location" on the system is stable or unstable depending on whether or not a perturbation off of the location grows or shrinks, which is measured differently in each system.
For a continuously differentiable dynamical system, a local perturbation around the evolution of the system near a fixed point is described by an exponential $e^{lambda t}$ since (taking liberal approximations) $x(t+Delta t) approx x(t) + lambda x(t) = (1 + lambda)x(t)$; the function grows if $lambda > 0$ and shrinks if the opposite.
For a discrete-time system like a Markov chain, local perturbations grow depending on whether or not the "next" step of the system is larger than the previous one, a.k.a. if $x_{n+1} = lambda x_{n} > x_n$. Hence, $lambda > 1$ indicates an unstable fixed point.
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
$endgroup$
add a comment |
$begingroup$
With discrete-time Markov processes, you’re examining the behavior of successively larger powers of a fixed matrix, which depends on successively larger powers of its eigenvalues. If there are any with modulus greater than one, those contributions to the matrix power will grow without bound, any with modulus less than one will tend toward zero, and any with modulus exactly one will neither grow nor shrink.
If the “system” you’re asking about is a system of differential equations, then instead of the behavior of successive powers of a matrix $A$ we’re interested in its exponential $e^{tA}$, which in turn depends on exponentials $e^{lambda t}$of its eigenvalues. Here, it’s eigenvalues with a positive real part whose contributions grow without bound, while the contributions of ones with a negative real part tend to zero.
answered 51 mins ago
amdamd
32.3k21053
$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
});
}
});
northerlywind 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%2f3202164%2fwhy-do-real-positive-eigenvalues-result-in-an-unstable-system-what-about-eigenv%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The key difference lies in the fact that the maps defined by a Markov matrix are discrete-time whereas the dynamical systems you refer to are continuous-time systems. In either case, a "location" on the system is stable or unstable depending on whether or not a perturbation off of the location grows or shrinks, which is measured differently in each system.
For a continuously differentiable dynamical system, a local perturbation around the evolution of the system near a fixed point is described by an exponential $e^{lambda t}$ since (taking liberal approximations) $x(t+Delta t) approx x(t) + lambda x(t) = (1 + lambda)x(t)$; the function grows if $lambda > 0$ and shrinks if the opposite.
For a discrete-time system like a Markov chain, local perturbations grow depending on whether or not the "next" step of the system is larger than the previous one, a.k.a. if $x_{n+1} = lambda x_{n} > x_n$. Hence, $lambda > 1$ indicates an unstable fixed point.
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
$endgroup$
add a comment |
$begingroup$
The key difference lies in the fact that the maps defined by a Markov matrix are discrete-time whereas the dynamical systems you refer to are continuous-time systems. In either case, a "location" on the system is stable or unstable depending on whether or not a perturbation off of the location grows or shrinks, which is measured differently in each system.
For a continuously differentiable dynamical system, a local perturbation around the evolution of the system near a fixed point is described by an exponential $e^{lambda t}$ since (taking liberal approximations) $x(t+Delta t) approx x(t) + lambda x(t) = (1 + lambda)x(t)$; the function grows if $lambda > 0$ and shrinks if the opposite.
For a discrete-time system like a Markov chain, local perturbations grow depending on whether or not the "next" step of the system is larger than the previous one, a.k.a. if $x_{n+1} = lambda x_{n} > x_n$. Hence, $lambda > 1$ indicates an unstable fixed point.
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
$endgroup$
add a comment |
$begingroup$
The key difference lies in the fact that the maps defined by a Markov matrix are discrete-time whereas the dynamical systems you refer to are continuous-time systems. In either case, a "location" on the system is stable or unstable depending on whether or not a perturbation off of the location grows or shrinks, which is measured differently in each system.
For a continuously differentiable dynamical system, a local perturbation around the evolution of the system near a fixed point is described by an exponential $e^{lambda t}$ since (taking liberal approximations) $x(t+Delta t) approx x(t) + lambda x(t) = (1 + lambda)x(t)$; the function grows if $lambda > 0$ and shrinks if the opposite.
For a discrete-time system like a Markov chain, local perturbations grow depending on whether or not the "next" step of the system is larger than the previous one, a.k.a. if $x_{n+1} = lambda x_{n} > x_n$. Hence, $lambda > 1$ indicates an unstable fixed point.
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
$endgroup$
The key difference lies in the fact that the maps defined by a Markov matrix are discrete-time whereas the dynamical systems you refer to are continuous-time systems. In either case, a "location" on the system is stable or unstable depending on whether or not a perturbation off of the location grows or shrinks, which is measured differently in each system.
For a continuously differentiable dynamical system, a local perturbation around the evolution of the system near a fixed point is described by an exponential $e^{lambda t}$ since (taking liberal approximations) $x(t+Delta t) approx x(t) + lambda x(t) = (1 + lambda)x(t)$; the function grows if $lambda > 0$ and shrinks if the opposite.
For a discrete-time system like a Markov chain, local perturbations grow depending on whether or not the "next" step of the system is larger than the previous one, a.k.a. if $x_{n+1} = lambda x_{n} > x_n$. Hence, $lambda > 1$ indicates an unstable fixed point.
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
edited 46 mins ago
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
answered 55 mins ago
aghostinthefiguresaghostinthefigures
1,3441217
1,3441217
add a comment |
add a comment |
$begingroup$
With discrete-time Markov processes, you’re examining the behavior of successively larger powers of a fixed matrix, which depends on successively larger powers of its eigenvalues. If there are any with modulus greater than one, those contributions to the matrix power will grow without bound, any with modulus less than one will tend toward zero, and any with modulus exactly one will neither grow nor shrink.
If the “system” you’re asking about is a system of differential equations, then instead of the behavior of successive powers of a matrix $A$ we’re interested in its exponential $e^{tA}$, which in turn depends on exponentials $e^{lambda t}$of its eigenvalues. Here, it’s eigenvalues with a positive real part whose contributions grow without bound, while the contributions of ones with a negative real part tend to zero.
answered 51 mins ago
amdamd
32.3k21053
$endgroup$
add a comment |
$begingroup$
With discrete-time Markov processes, you’re examining the behavior of successively larger powers of a fixed matrix, which depends on successively larger powers of its eigenvalues. If there are any with modulus greater than one, those contributions to the matrix power will grow without bound, any with modulus less than one will tend toward zero, and any with modulus exactly one will neither grow nor shrink.
If the “system” you’re asking about is a system of differential equations, then instead of the behavior of successive powers of a matrix $A$ we’re interested in its exponential $e^{tA}$, which in turn depends on exponentials $e^{lambda t}$of its eigenvalues. Here, it’s eigenvalues with a positive real part whose contributions grow without bound, while the contributions of ones with a negative real part tend to zero.
answered 51 mins ago
amdamd
32.3k21053
$endgroup$
add a comment |
$begingroup$
With discrete-time Markov processes, you’re examining the behavior of successively larger powers of a fixed matrix, which depends on successively larger powers of its eigenvalues. If there are any with modulus greater than one, those contributions to the matrix power will grow without bound, any with modulus less than one will tend toward zero, and any with modulus exactly one will neither grow nor shrink.
If the “system” you’re asking about is a system of differential equations, then instead of the behavior of successive powers of a matrix $A$ we’re interested in its exponential $e^{tA}$, which in turn depends on exponentials $e^{lambda t}$of its eigenvalues. Here, it’s eigenvalues with a positive real part whose contributions grow without bound, while the contributions of ones with a negative real part tend to zero.
answered 51 mins ago
amdamd
32.3k21053
$endgroup$
With discrete-time Markov processes, you’re examining the behavior of successively larger powers of a fixed matrix, which depends on successively larger powers of its eigenvalues. If there are any with modulus greater than one, those contributions to the matrix power will grow without bound, any with modulus less than one will tend toward zero, and any with modulus exactly one will neither grow nor shrink.
If the “system” you’re asking about is a system of differential equations, then instead of the behavior of successive powers of a matrix $A$ we’re interested in its exponential $e^{tA}$, which in turn depends on exponentials $e^{lambda t}$of its eigenvalues. Here, it’s eigenvalues with a positive real part whose contributions grow without bound, while the contributions of ones with a negative real part tend to zero.
answered 51 mins ago
amdamd
32.3k21053
answered 51 mins ago
amdamd
32.3k21053
answered 51 mins ago
amdamd
32.3k21053
answered 51 mins ago
amdamd
32.3k21053
32.3k21053
add a comment |
add a comment |
northerlywind is a new contributor. Be nice, and check out our Code of Conduct.
northerlywind is a new contributor. Be nice, and check out our Code of Conduct.
northerlywind is a new contributor. Be nice, and check out our Code of Conduct.
northerlywind 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.
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%2f3202164%2fwhy-do-real-positive-eigenvalues-result-in-an-unstable-system-what-about-eigenv%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
