Numerical analysis of a quadratic matrix equation

The quadratic matrix equation AX2+ BX + C = 0in n × nmatrices arises in applications and is of intrinsic interest as one of the simplest nonlinear matrix equations. We give a complete characterization of solutions in terms of the generalized Schur decomposition and describe and compare various numerical solution techniques. In particular, we give a thorough treatment of functional iteration methods based on Bernoulli’s method. Other methods considered include Newton’s method with exact line searches, symbolic solution and continued fractions. We show that functional iteration applied to the quadratic matrix equation can provide an efficient way to solve the associated quadratic eigenvalue problem (λ2A + λB + C)x = 0.