For two normal matrices of the same size, a pairing of their eigenvalues has squared Euclidean discrepancy at most the squared Frobenius norm of their difference. For Hermitian matrices, the increasing real eigenvalue order gives such a pairing, because it minimizes squared discrepancy. For real symmetric matrices, the norm square is .
For equally sized Hermitian matrices and a real test function with Lipschitz bound one, the difference of its averages under their empirical spectral measures is at most times the Frobenius norm of their difference. Pair the increasing eigenvalues, apply the triangle inequality and Cauchy-Schwarz inequality, then use the Hoffman–Wielandt inequality.
If a normal matrix satisfies , then . Indeed, is normal and . Since , also . This identity proves orthogonality of distinct eigenspaces and gives spectral restrictions for Hermitian matrices, skew-Hermitian matrices and unitary matrices.
For with real parameters,Thus the displayed conditions are necessary and sufficient for a normal matrix. In the family , , normality requires , not . If , this is the formal value and no positive Reynolds number qualifies. At that value is a skew-Hermitian matrix and its exponential is unitary, so every initial direction has optimal energy amplification of a linear system equal to one.
For every finite-dimensional normal matrix , the matrix 2-norm equals the spectral radius:This follows by unitary diagonalization of a normal matrix and unitary invariance of the matrix 2-norm.
A matrix is non-normal when it does not commute with its adjoint. Its eigenvectors need not be orthogonal, so combinations of individually decaying modes may grow temporarily.
Transient growth is finite-time amplification in a stable linear system. For a non-normal generator it can occur even when every eigenvalue has negative real part, because nonorthogonal eigenmodes can interfere constructively.
For and , the Hermitian matrix gives . Thus some initial condition grows immediately iff the largest eigenvalue of is positive. All trajectories have nonincreasing energy iff is a negative semidefinite matrix. This differs from requiring negative real parts for the eigenvalues of : a non-normal matrix can satisfy modal decay while allowing transient growth.
For the matrix exponential , maximizing the energy ratio over nonzero initial conditions givesThe Rayleigh quotient achieves its maximum at an eigenvector of with largest eigenvalue, equivalently a right singular vector of . Such an optimal disturbance is generally not an eigenvector of .
For with distinct real negative eigenvalues, the matrix exponential is , where , and . The optimal energy amplification of a linear system isIts eigenvectors are nonorthogonal, and immediate energy growth occurs exactly when . If , putting gives . The optimal asymptotic initial direction is an adjoint eigenvector, while the eventual state aligns with the right eigenvector .
For with , put and . The optimal energy amplification of a linear system reaches its maximum atThe maximizing initial orientation is and the final orientation is from the orientation interval for transient energy growth. Taking gives the displayed viscous-time and Reynolds-squared asymptotics. These constants belong to this specified triangular model, not to every non-normal matrix.
For and , write . The energy derivative is , positive exactly between the displayed orientations. Linear trajectories cross the sector from to because . An energy-neutral rotational nonlinearity can reverse the crossing direction; the growth sector itself remains the same.
A nonlinear term with real skew-symmetric matrix contributes zero to the derivative of the quadratic energy . It changes orientation rather than magnitude directly. If a separate linear generator is a non-normal matrix, that reorientation can still alter later transient growth, so energy cancellation alone does not make the nonlinear evolution equivalent to the linear one.
Every finite-dimensional complex normal matrix has an orthonormal eigenbasis, equivalentlyfor some unitary and diagonal .
Articles by others on the same topic
In linear algebra, a **normal matrix** is a type of matrix that commutes with its own conjugate transpose. Specifically, a square matrix \( A \) is defined as normal if it satisfies the condition: \[ AA^* = A^*A \] where \( A^* \) denotes the conjugate transpose (or Hermitian transpose) of matrix \( A \).