Hurwitz-Stable Matrix¶

A square matrix whose eigenvalues all have strictly negative real part, making the continuous-time linear system ẋ=Ax exponentially decay to the origin.

Version: v4 · 2026-09-19 · History
Domain-specific #: 2026
Domain group: Applied Sciences & Engineering
Origin domain: Engineering & Design (beyond software)
Subdomain: Control Theory → Engineering & Design (beyond software)
Aliases: Hurwitz matrix, Continuous-time stable matrix, Stability matrix

Core Idea¶

A square matrix \(A\in\mathbb C^{n\times n}\) is Hurwitz stable when every eigenvalue lies strictly in the open left half-plane:

\[ \operatorname{Re}\lambda_i(A)<0\quad\text{for all }i. \]

Equivalently, every solution of the homogeneous continuous-time LTI system \(\dot x=Ax\) converges exponentially to zero. For every (Q=Q^T>0), this is also equivalent to the Lyapunov equation

\[ A^TP+PA=-Q \]

having a unique symmetric positive-definite solution (P).^[1]

The recognition invariant is square state matrix + open-left-half-plane spectrum + continuous-time convention + exponential decay.

How would you explain it like I'm…

The Always-Settles-Down Rule

Think of a swing you push once. If it slowly settles down and stops, it is steady. A Hurwitz-Stable Matrix is the math rule-box for a machine where every push, in any direction, always fades away to stillness instead of growing.

The Wobbles-Die-Out Matrix

Engineers describe many machines with a square grid of numbers called a matrix, which tells how the machine's state changes over time. Each matrix has special numbers called eigenvalues that describe its natural behaviors. A Hurwitz-Stable Matrix is one where all those special numbers point toward 'shrinking.' That means if you knock the machine away from rest, it always comes back to rest, and the wobble gets smaller quickly and steadily. This is for machines that change smoothly in time, not in jumps.

Left-Half-Plane Stable Matrix

A square matrix A is Hurwitz stable if every eigenvalue has a strictly negative real part, meaning all eigenvalues sit in the open left half of the complex plane. This matters for continuous-time systems written as dx/dt = Ax: Hurwitz stability is exactly the condition that every solution shrinks to zero exponentially. Eigenvalues with real part exactly zero are not allowed, since those would give oscillations that never die out. The 'continuous-time' part is important; systems that update in discrete steps use a different stability test. Another equivalent check uses the Lyapunov equation, which has a positive-definite solution exactly when the matrix is Hurwitz stable.

A square matrix A (real or complex, n×n) is Hurwitz stable when every eigenvalue satisfies Re λ_i(A) < 0, i.e. the spectrum lies in the open left half-plane. This is equivalent to every solution of the continuous-time LTI system ẋ = Ax converging exponentially to zero. A third equivalent test is Lyapunov's: for any symmetric positive-definite Q, the equation AᵀP + PA = −Q has a unique symmetric positive-definite solution P, which yields the quadratic Lyapunov function xᵀPx. The condition is strict—eigenvalues on the imaginary axis are excluded—and it belongs to the continuous-time convention, distinct from Schur stability for discrete-time systems. The recognition test: square state matrix, open-left-half-plane spectrum, continuous time, exponential decay.

Structural Signature¶

Square real or complex matrix (A).
Eigenvalues counted with algebraic multiplicity.
Strict real-part inequality.
Continuous-time state equation \(\dot x=Ax\).
Matrix exponential (e^{At}) decaying exponentially.
Asymptotically/exponentially stable origin.
Lyapunov equation or inequality certificate.
Characteristic polynomial and Routh–Hurwitz tests where useful.
Stability margin measured by distance from the imaginary axis.
Similarity invariance of the property.
Robustness sensitivity under perturbation/non-normality.
Distinction between state-matrix stability and transfer-function terminology.
Linearization use bounded by nonlinear hypotheses.

What It Is Not¶

It is not Schur stability, which is the discrete-time condition |\(\lambda_i\)|<1. It is not merely “no positive eigenvalues”: eigenvalues on the imaginary axis fail strict Hurwitz stability. It is not positive definiteness or symmetry; a nonsymmetric matrix can be Hurwitz.^[2]

It is not the Routh–Hurwitz matrix constructed from polynomial coefficients, though that matrix and its minors can test whether a polynomial’s roots lie in the left half-plane. It also does not guarantee favorable transient amplification for a highly non-normal matrix.

Scope of Application¶

Hurwitz matrices characterize internal stability of continuous-time LTI systems, local exponential stability of nonlinear equilibria through a Hurwitz Jacobian, observer and controller design, filters, consensus dynamics after mode removal, and linear stochastic systems.^[3]

For a state-space model with inputs and outputs, Hurwitz (A) ensures internal zero-input decay. Input–output stability and minimal realizations require their own assumptions; unstable hidden modes can be absent from a transfer function.

Clarity¶

The condition is strict. A zero eigenvalue or pure imaginary conjugate pair is marginal/non-Hurwitz even when some trajectories remain bounded.

“Negative feedback” is not an eigenvalue-by-eigenvalue synonym. Feedback architecture can move the closed-loop spectrum left, but matrix entries or diagram signs alone do not prove Hurwitz stability.

Manages Complexity¶

The spectrum reduces an infinite-time trajectory question to finitely many complex numbers. The Lyapunov formulation replaces explicit eigenvalue calculation with a positive-definite matrix certificate and supports inequalities, uncertainty, and optimization.

Non-normal matrices warn that asymptotic decay can coexist with large finite transient growth; stability class is not a full performance description.

Abstract Reasoning¶

Confirm continuous-time and isolate the square state matrix.
Compute or bound its spectral abscissa.
Require every real part to be strictly negative.
Alternatively solve a Lyapunov equation for chosen (Q>0).
Check numerical conditioning and uncertainty margins.
Distinguish asymptotic behavior from transient gain.
For nonlinear systems, verify differentiability and linearization hypotheses.
For transfer functions, distinguish poles from hidden state modes.

Knowledge Transfer¶

The portable structure is a spectral certificate translating local generator properties into long-run decay. The proposed immediate parent is Matrix.

Examples¶

Diagonal system. \(A=\operatorname{diag}(-1,-3)\) is Hurwitz and (e^{At}) decays componentwise.

Oscillatory decay. Eigenvalues \(-0.2\pm4i\) are Hurwitz: trajectories oscillate while their envelope decays.

Non-example. A discrete-time matrix with eigenvalue (-2) is not Schur stable even though its eigenvalue has negative real part; Hurwitz is the wrong time convention.

Structural Tensions¶

Asymptotic decay versus transient amplification.
Eigenvalue test versus Lyapunov certificate.
Strict stability versus marginal modes.
Internal state stability versus input–output appearance.
Nominal spectrum versus robustness margin.
Linearization verdict versus nonlinear global behavior.

Structural–Framed Character¶

Spectrum, inequality, decay, certificate, and invariance are structural. State matrices, continuous time, Lyapunov equations, poles, and control design are domain frame.

Structural Core vs. Domain Accent¶

The portable core is a generator whose spectrum lies in a decay region. Left-half-plane geometry, matrix exponentials, state equations, Lyapunov certificates, and control margins are constitutive domain accent.

This entry is a kind of Matrix.

Matrix is the broader abstraction this entry instantiates. Stability, Exponential Decay, Eigenvalue and Eigenvector, Lyapunov Function, and Robustness are related. QR Algorithm may compute eigenvalues but does not define the class.

Relationships to Other Abstractions¶

Current abstraction Hurwitz-Stable Matrix Domain-specific

Parents (1) — outgoing typed relations

Hurwitz-Stable Matrix is a kind of Matrix Domain-specific

Matrix is the broader abstraction this entry instantiates.

Hierarchy paths (5) — routes to 5 parentless roots

Hurwitz-Stable Matrix → is a kind of Matrix → is a kind of, conditional Tensor → presupposes Transformation → is a kind of, typical Function (Mapping)

Show alternative paths (4)

Neighborhood in Abstraction Space¶

Hurwitz-Stable Matrix sits in a sparse region of the domain-specific corpus (93^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Schur-stable matrix.
Routh–Hurwitz coefficient matrix.
Positive-definite matrix.
A matrix with merely nonpositive spectral real parts.
Transfer-function stability without realization checks.
Absence of transient amplification.

References¶

[1] Hassan K. Khalil, Nonlinear Systems, 3^rd ed., Prentice Hall, 2002. registry ↩

[2] Thomas Kailath, Linear Systems, Prentice-Hall, 1980. openlibrary.org registry ↩

[3] Chi-Tsong Chen, Linear System Theory and Design, 3^rd ed., Oxford University Press, 1999. registry ↩

[4] Roger A. Horn and Charles R. Johnson, Matrix Analysis, 2^nd ed., Cambridge University Press, 2013. registry ↩ Show verification details