Low Rank Solution of Lyapunov Equations (Q4785771)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1848590
Language Label Description Also known as
default for all languages
No label defined
    English
    Low Rank Solution of Lyapunov Equations
    scientific article; zbMATH DE number 1848590

      Statements

      Low Rank Solution of Lyapunov Equations (English)
      0 references
      5 January 2003
      0 references
      Cholesky factorization
      0 references
      numerical examples
      0 references
      algorithm
      0 references
      rational Krylov subspace
      0 references
      The Cholesky factor-alternating direction implicit algorithm is presented to compute a low rank approximation to the solution \(X\) of the Lyapunov equation \(AX+XA^T=-BB^T\) with large matrix \(A\) and right hand side of low rank. The algorithm requires only matrix-vector products and linear solvers. The dominant invariant subspace of the solution is also approximated and a spanning set for the range of \(X\) is characterized. Numerical examples show that the rational Krylov subspace generated by the new algorithm, where the shifts are obtained as the solution of a rational minimax problem, often gives the best approximation to the dominant invariant subspace of \(X\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references