We investigate the numerical solution of the stable generalized Lyapunov equation via the sign function method. This approach has already been proposed to solve standard Lyapunov equations in several publications. The extension to the generalized case is straightforward. We consider some modifications and discuss how to solve generalized Lyapunov equations with semidefinite constant term for the Cholesky factor. The basic computational tools of the method are basic linear algebra operations that can be implemented efficiently on modern computer architectures and in particular on parallel computers. Hence, a considerable speed-up as compared to the Bartels-Stewart and Hammarling's methods is to be expected. We compare the algorithms by performing a variety of numerical tests.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18350 |
| Date | 07 September 2005 |
| Creators | Benner, Peter, Quintana-OrtÃ, Enrique S. |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
| Source | Preprintreihe des Chemnitzer SFB 393 |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0026 seconds