A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations

From MaRDI portal





This paper addresses the numerical solution of a large, sparse, stable, Lyapunov equation \(A^TX+ XA= -BB^T\), with right-hand side matrix of low rank. Low-rank versions of the alternating direction implicit (LR-ADI) method and the cyclic Smith (LR-Smith\((l)\)) method are proposed. The LR-Smith\((l)\) method is of particular interest because the proper choice of \(l\) different shift parameters, where \(l\) is of moderate size, generally ensures a rapid convergence of the ADI method. Furthermore, a heuristic algorithm for determining a set of \(l\) suboptimal ADI parameters is given. The algorithm does not require any a priori knowledge about the spectrum of the matrix \(A\). All information about this matrix is gained from a pair of Arnoldi processes. Thus, LR-Smith\((l)\) combined with the algorithm for determining the ADI parameters can be considered as a ``black box solver for large, sparse, stable Lyapunov equations.




Cited in
(only showing first 100 items - show all)


Describes a project that uses

Uses Software






This page was built for publication: A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509779)