Comparison of numerical methods for solving Liapunov matrix equations

Abstract A numerical comparison is made of most published methods for solving the linear matrix equations which arise when a quadratic form Liapunov function is applied to a constant linear system (continuous or discrete, real or complex). Generally, for the real equations direct methods are satisfactory for systems of order ten or less, whereas for larger order systems iterative methods (based upon expressing the solution in terms of an infinite series) are to be preferred. For the complex equations the most convenient numerical method uses an explicit representation for the solution in terms of the eigenvalues and vectors of the system matrix. If the system matrix is in companion form then algorithms taking account of this structure offer minor improvements.