Block variants of Hammarling's method for solving Lyapunov equations

  • Authors:
  • Daniel Kressner

  • Affiliations:
  • Umeå University, Umeå, Sweden

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article is concerned with the efficient numerical solution of the Lyapunov equation AT X + XA &equls; −C with a stable matrix A and a symmetric positive semidefinite matrix C of possibly small rank. We discuss the efficient implementation of Hammarling's method and propose among other algorithmic improvements a block variant, which is demonstrated to perform significantly better than existing implementations. An extension to the discrete-time Lyapunov equation ATXA − X = −C is also described.