Exponential Condition Number of Solutions of the Discrete Lyapunov Equation
Abstract
The condition number of the n\ x\ n matrix P is examined, where P solves %the discete Lyapunov equation, P - A P A* = BB*, and B is a n\ x\ d matrix. Lower bounds on the condition number, , of P are given when A is normal, a single Jordan block or in Frobenius form. The bounds show that the ill-conditioning of P grows as (n/d) >> 1. These bounds are related to the condition number of the transformation that takes A to input normal form. A simulation shows that P is typically ill-conditioned in the case of n>>1 and d=1. When Aij has an independent Gaussian distribution (subject to restrictions), we observe that (P)1/n ~= 3.3. The effect of auto-correlated forcing on the conditioning on state space systems is examined
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.