Skip to main content
SpringerLink
Log in

Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by formatted arithmetic for hierarchical matrices, we obtain an implementation that has linear-polylogarithmic complexity and memory requirements. The method is well suited for Lyapunov operators arising from FEM and BEM approximations to elliptic differential operators. With the sign function method it is possible to obtain a low-rank approximation to a full-rank factor of the solution directly. The task of computing such a factored solution arises, e.g., in model reduction based on balanced truncation. The basis of our method is a partitioned Newton iteration for computing the sign function of a suitable matrix, where one part of the iteration uses formatted arithmetic while the other part directly yields approximations to the full-rank factor of the solution. We discuss some variations of our method and its application to generalized Lyapunov equations. Numerical experiments show that the method can be applied to problems of order up to (105) on workstations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • A. Antoulas (2005) Approximation of large-scale dynamical systems SIAM Publications Philadelphia, PA Occurrence Handle02230083

    MATH  Google Scholar 

  • A. Antoulas D. Sorensen Y. Zhou (2002) ArticleTitleOn the decay rate of Hankel singular values and related issues Sys. Control Lett. 46 IssueID5 323–342 Occurrence Handle1003.93024 Occurrence Handle2011320 Occurrence Handle10.1016/S0167-6911(02)00147-0

    Article  MATH  MathSciNet  Google Scholar 

  • Badía, R., Benner, P., Mayo, R., Quintana-Ortí, E.: Solving large sparse Lyapunov equations on parallel computers. In: Euro-Par 2002 – Parallel Processing (B. Monien and R. Feldmann, eds.). Lecture Notes in Computer Science, vol. 2400, pp. 687–690. Berlin Heidelberg New York: Springer 2002.

  • Bai, Z., Demmel, J.: Design of a parallel nonsymmetric eigenroutine toolbox, part I. In: Proc. 6th SIAM Conf. on Parallel Processing for Scientific Computing, pp. 391–398. Philadelphia, PA: SIAM Publications 1993. See also: Tech. Report CSD-92-718, Computer Science Division, University of California, Berkeley, CA, USA.

  • R. H. Bartels G. W. Stewart (1972) ArticleTitleSolution of the matrix equation AX+XB=C: Algorithm 432 Comm. ACM 15 820–826 Occurrence Handle10.1145/361573.361582

    Article  Google Scholar 

  • P. Benner (2004) ArticleTitleSolving large-scale control problems IEEE Control Sys. Mag. 14 IssueID1 44–59 Occurrence Handle2104509 Occurrence Handle10.1109/MCS.2004.1272745

    Article  MathSciNet  Google Scholar 

  • P. Benner J. Claver E. Quintana-Ortí (1999) ArticleTitleParallel distributed solvers for large stable generalized Lyapunov equations Paral. Proc. Lett. 9 IssueID1 147–158 Occurrence Handle10.1142/S0129626499000165

    Article  Google Scholar 

  • Benner, P., Mehrmann, V., Sima, V., Huffel, S. V., Varga, A.: SLICOT – a subroutine library in systems and control theory. In: Applied and Computational Control (B. Datta, ed.): Signals and Circuits, vol. 1, chap. 10, pp. 499–539. Boston, MA: Birkhäuser 1999.

  • P. Benner E. Quintana-Ortí (1999) ArticleTitleSolving stable generalized Lyapunov equations with the matrix sign function Numer. Algorith. 20 IssueID1 75–100 Occurrence Handle0940.65035 Occurrence Handle10.1023/A:1019191431273

    Article  MATH  Google Scholar 

  • P. Benner E. Quintana-Ortí G. Quintana-Ortí (2000) ArticleTitleBalanced truncation model reduction of large-scale dense systems on parallel computers Math. Comput. Model. Dyn. Sys. 6 IssueID4 383–405 Occurrence Handle0978.93013 Occurrence Handle10.1076/mcmd.6.4.383.3658

    Article  MATH  Google Scholar 

  • P. Benner E. Quintana-Ortí G. Quintana-Ortí (2006) ArticleTitleSolving stable Sylvester equations via rational iterative schemes J. Sci. Comp. 28 IssueID1 51–83 Occurrence Handle10.1007/s10915-005-9007-2

    Article  Google Scholar 

  • C. Bischof G. Quintana-Ortí (1998) ArticleTitleAlgorithm 782: codes for rank-revealing QR factorizations of dense matrices ACM Trans. Math. Software 24 IssueID2 254–257 Occurrence Handle0932.65034 Occurrence Handle1663957 Occurrence Handle10.1145/290200.287638

    Article  MATH  MathSciNet  Google Scholar 

  • Börm, S., Grasedyck, L., Hackbusch, W.: HLib 1.3, 2004. Available from http://www.hlib.org.

  • R. Byers (1987) ArticleTitleSolving the algebraic Riccati equation with the matrix sign function Linear Algebra Appl. 85 267–279 Occurrence Handle0611.65027 Occurrence Handle869359 Occurrence Handle10.1016/0024-3795(87)90222-9

    Article  MATH  MathSciNet  Google Scholar 

  • R. Byers C. He V. Mehrmann (1997) ArticleTitleThe matrix sign function method and the computation of invariant subspaces SIAM J. Matrix Anal. Appl. 18 IssueID3 615–632 Occurrence Handle0874.65031 Occurrence Handle1453543 Occurrence Handle10.1137/S0895479894277454

    Article  MATH  MathSciNet  Google Scholar 

  • L. Dai (1989) Singular control systems. Lecture Notes in Control and Information Sciences, Vol. 118 Springer Berlin

    Google Scholar 

  • B. Datta (2004) Numerical methods for linear control systems Elsevier Amsterdam Occurrence Handle1079.65072

    MATH  Google Scholar 

  • J. Gardiner A. Laub (1986) ArticleTitleA generalization of the matrix-sign-function solution for algebraic Riccati equations Int. J. Control 44 823–832 Occurrence Handle0598.15012

    MATH  Google Scholar 

  • G. H. Golub C. F. Loan ParticleVan (1996) Matrix computations EditionNumber3 Johns Hopkins University Press Baltimore

    Google Scholar 

  • Grasedyck, L.: Theorie und Anwendungen hierarchischer Matrizen. Diss., University of Kiel, Kiel, Germany, 2001 (in German), available at http://e-diss.uni-kiel.de/diss_454.

  • L. Grasedyck (2004) ArticleTitleExistence of a low rank or H-matrix approximant to the solution of a Sylvester equation Numer. Lin. Alg. Appl. 11 371–389 Occurrence Handle2057708 Occurrence Handle10.1002/nla.366

    Article  MathSciNet  Google Scholar 

  • L. Grasedyck W. Hackbusch (2003) ArticleTitleConstruction and arithmetics of -matrices Computing 70 IssueID4 295–334 Occurrence Handle1030.65033 Occurrence Handle2011419 Occurrence Handle10.1007/s00607-003-0019-1

    Article  MATH  MathSciNet  Google Scholar 

  • Grasedyck, L., Hackbusch, W.: A multigrid method to solve large scale Sylvester equations. Preprint 48, Max-Planck Institut für Mathematik in den Naturwissenschaften, Leipzig, Germany, 2004.

  • L. Grasedyck W. Hackbusch B. N. Khoromskij (2003) ArticleTitleSolution of large scale algebraic matrix Riccati equations by use of hierarchical matrices Computing 70 121–165 Occurrence Handle1982969 Occurrence Handle10.1007/s00607-002-1470-0

    Article  MathSciNet  Google Scholar 

  • S. Gugercin D. Sorensen A. Antoulas (2003) ArticleTitleA modified low-rank Smith method for large-scale Lyapunov equations Numer. Algorith. 32 IssueID1 27–55 Occurrence Handle1034.93020 Occurrence Handle1960752 Occurrence Handle10.1023/A:1022205420182

    Article  MATH  MathSciNet  Google Scholar 

  • W. Hackbusch (1999) ArticleTitleA sparse matrix arithmetic based on -matrices. I. Introduction to -matrices Computing 62 IssueID2 89–108 Occurrence Handle0927.65063 Occurrence Handle1694265 Occurrence Handle10.1007/s006070050015

    Article  MATH  MathSciNet  Google Scholar 

  • W. Hackbusch B. N. Khoromskij (2000) ArticleTitleA sparse -matrix arithmetic. II. Application to multi-dimensional problems Computing 64 IssueID1 21–47 Occurrence Handle0962.65029 Occurrence Handle1755846

    MATH  MathSciNet  Google Scholar 

  • S. Hammarling (1982) ArticleTitleNumerical solution of the stable, nonnegative definite Lyapunov equation IMA J. Numer. Anal. 2 303–323 Occurrence Handle0492.65017 Occurrence Handle678019

    MATH  MathSciNet  Google Scholar 

  • G. Hewer C. Kenney (1988) ArticleTitleThe sensitivity of the stable Lyapunov equation SIAM J. Cont. Optim. 26 321–344 Occurrence Handle0655.93050 Occurrence Handle929804 Occurrence Handle10.1137/0326018

    Article  MATH  MathSciNet  Google Scholar 

  • N. Higham (1986) ArticleTitleComputing the polar decomposition – with applications SIAM J. Sci. Statist. Comput. 7 1160–1174 Occurrence Handle0607.65014 Occurrence Handle857788 Occurrence Handle10.1137/0907079

    Article  MATH  MathSciNet  Google Scholar 

  • N. Higham (1996) Accuracy and stability of numerical algorithms SIAM Publications Philadelphia, PA Occurrence Handle1011.65010

    MATH  Google Scholar 

  • M. Hochbruck G. Starke (1995) ArticleTitlePreconditioned Krylov subspace methods for Lyapunov matrix equations SIAM J. Matrix Anal. Appl. 16 IssueID1 156–171 Occurrence Handle0827.65048 Occurrence Handle1311424 Occurrence Handle10.1137/S0895479892239238

    Article  MATH  MathSciNet  Google Scholar 

  • A. Hodel B. Tenison K. Poolla (1996) ArticleTitleNumerical solution of the Lyapunov equation by approximate power iteration Linear Algebra Appl. 236 205–230 Occurrence Handle0848.65033 Occurrence Handle1375615 Occurrence Handle10.1016/0024-3795(94)00155-3

    Article  MATH  MathSciNet  Google Scholar 

  • I. Jaimoukha E. Kasenally (1994) ArticleTitleKrylov subspace methods for solving large Lyapunov equations SIAM J. Numer. Anal. 31 227–251 Occurrence Handle0798.65060 Occurrence Handle1259974 Occurrence Handle10.1137/0731012

    Article  MATH  MathSciNet  Google Scholar 

  • K. Jbilou A. J. Riquet (2006) ArticleTitleProjection methods for large Lyapunov matrix equations Linear Algebra Appl. 415 IssueID2–3 344–358 Occurrence Handle05028754 Occurrence Handle2227778 Occurrence Handle10.1016/j.laa.2004.11.004

    Article  MATH  MathSciNet  Google Scholar 

  • P. Lancaster M. Tismenetsky (1985) The theory of matrices EditionNumber2 Academic Press Orlando Occurrence Handle0558.15001

    MATH  Google Scholar 

  • J. R. Li J. White (2001) ArticleTitleReduction of large circuit models via low rank approximate gramians Int. J. Appl. Math. Comp. Sci. 11 IssueID5 1151–1171 Occurrence Handle0995.93027 Occurrence Handle1885304

    MATH  MathSciNet  Google Scholar 

  • J. R. Li J. White (2002) ArticleTitleLow rank solution of Lyapunov equations SIAM J. Matrix Anal. Appl. 24 IssueID1 260–280 Occurrence Handle1027.42029 Occurrence Handle1920565 Occurrence Handle10.1137/S0895479801384937

    Article  MATH  MathSciNet  Google Scholar 

  • Moore, B. C.: Principal component analysis in linear systems: Controllability, observability, and model reduction. IEEE Trans. Automat. Control, AC-26: 17–32 (1981).

    Google Scholar 

  • G. Obinata B. Anderson (2001) Model reduction for control system design. Communications and Control Engineering Series Springer London

    Google Scholar 

  • Penzl, T.: A multi-grid method for generalized Lyapunov equations. Technical Report SFB393/ 97-24, Fakultät für Mathematik, TU Chemnitz, Chemnitz, Germany, 1997. Available from http://www.tu-chemnitz.de/sfb393/sfb97pr.html.

  • Penzl, T.: Numerische Lösung großer Lyapunov-Gleichungen. Berlin: Logos-Verlag 1998. Diss. Fakultät für Mathematik, TU Chemnitz, 1998.

  • T. Penzl (2006) ArticleTitleAlgorithms for model reduction of large dynamical systems Linear Algebra Appl. 415 IssueID2–3 322–343 Occurrence Handle05028753 Occurrence Handle2227777 Occurrence Handle10.1016/j.laa.2006.01.007

    Article  MATH  MathSciNet  Google Scholar 

  • T. Penzl (2000) ArticleTitleA cyclic low rank Smith method for large sparse Lyapunov equations SIAM J. Sci. Comput. 21 IssueID4 1401–1418 Occurrence Handle0958.65052 Occurrence Handle1742324 Occurrence Handle10.1137/S1064827598347666

    Article  MATH  MathSciNet  Google Scholar 

  • T. Penzl (2000) ArticleTitleEigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case Sys. Control Lett. 40 139–144 Occurrence Handle0977.93034 Occurrence Handle1829181 Occurrence Handle10.1016/S0167-6911(00)00010-4

    Article  MATH  MathSciNet  Google Scholar 

  • J. D. Roberts (1980) ArticleTitleLinear model reduction and solution of the algebraic Riccati equation by use of the sign function Int. J. Control 32 677–687 Occurrence Handle0463.93050

    MATH  Google Scholar 

  • I. Rosen C. Wang (1995) ArticleTitleA multi–level technique for the approximate solution of operator Lyapunov and algebraic Riccati equations SIAM J. Numer. Anal. 32 IssueID2 514–541 Occurrence Handle0857.65047 Occurrence Handle1324300 Occurrence Handle10.1137/0732022

    Article  MATH  MathSciNet  Google Scholar 

  • S. A. Sauter C. Schwab (2004) Randelementmethoden Teubner Stuttgart Leipzig Wiesbaden Occurrence Handle1059.65108

    MATH  Google Scholar 

  • V. Sima (1996) Algorithms for linear-quadratic optimization. Pure and Applied Mathematics, Vol. 200 Marcel Dekker New York, NY

    Google Scholar 

  • R. Smith (1968) ArticleTitleMatrix equation XA + BX = C SIAM J. Appl. Math. 16 IssueID1 198–201 Occurrence Handle0157.22603 Occurrence Handle224268 Occurrence Handle10.1137/0116017

    Article  MATH  MathSciNet  Google Scholar 

  • T. Stykel (2004) ArticleTitleGramian-based model reduction for descriptor systems Math. Control Signals Sys. 16 IssueID4 297–319 Occurrence Handle1067.93011 Occurrence Handle2052378 Occurrence Handle10.1007/s00498-004-0141-4

    Article  MATH  MathSciNet  Google Scholar 

  • Varga, A.: Model reduction software in the SLICOT library. In: Applied and Computational Control, Signals, and Circuits (Datta, B., ed.). Kluwer International Series in Engineering and Computer Science, Vol. 629, pp. 239–282. Boston, MA: Kluwer Academic Publishers 2001.

  • E. Wachspress (1988) ArticleTitleIterative solution of the Lyapunov matrix equation Appl. Math. Lett. 107 87–90 Occurrence Handle947171 Occurrence Handle10.1016/0893-9659(88)90183-8

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Technische Universität Berlin, Straße des 17. Juni 136, 10623, Berlin, Germany

    U. Baur

  2. Fakultät für Mathematik, Technische Universität Chemnitz, Reichenhainer Str. 41, 09126, Chemnitz, Germany

    P. Benner

Authors
  1. U. Baur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Benner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to U. Baur.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baur, U., Benner, P. Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic. Computing 78, 211–234 (2006). https://doi.org/10.1007/s00607-006-0178-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0178-y

AMS Subject Classifications

Keywords

Search

Navigation