Numerical solution of generalized Lyapunov equations
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The first one is a generalization of the Bartels–Stewart method and the second is an extension of Hammarling's method to generalized Lyapunov equations. Our LAPACK based subroutines are implemented in a quite flexible way. They can handle the transposed equations and provide scaling to avoid overflow in the solution. Moreover, the Bartels–Stewart subroutine offers the optional estimation of the separation and the reciprocal condition number. A brief description of both algorithms is given. The performance of the software is demonstrated by numerical experiments.
Unable to display preview. Download preview PDF.
- B.S. Garbow, J.M. Boyle, J.J. Dongarra and C.B. Moler, Matrix Eigensystem Routines – EISPACK Guide Extension, Lecture Notes in Computer Science 51 (Springer, New York, 1977).Google Scholar
- G.H. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins University Press, Baltimore, MD, 3rd ed., 1996).Google Scholar
- Working Group on Software (WGS), Implementation and documentation standards, WGS-Report 90-1, Eindhoven/Oxford (1990).Google Scholar