[go: up one dir, main page]

Skip to main content
Log in

Solution of Large Scale Algebraic Matrix Riccati Equations by Use of Hierarchical Matrices

  • Published:
Computing Aims and scope Submit manuscript

In previous papers, a class of hierarchical matrices (ℋ-matrices) is introduced which are data-sparse and allow an approximate matrix arithmetic of almost optimal complexity. Here, we investigate a new approach to exploit the ℋ-matrix structure for the solution of large scale Lyapunov and Riccati equations as they typically arise for optimal control problems where the constraint is a partial differential equation of elliptic type. This approach leads to an algorithm of linear-logarithmic complexity in the size of the matrices.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

Authors

Additional information

Received July 30, 2002; revised December 16, 2002 Published online: April 22, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grasedyck, L., Hackbusch, W. & Khoromskij, B. Solution of Large Scale Algebraic Matrix Riccati Equations by Use of Hierarchical Matrices. Computing 70, 121–165 (2003). https://doi.org/10.1007/s00607-002-1470-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-002-1470-0

Navigation