From low-rank approximation to an efficient rational Krylov subspace method for the Lyapunov equation
D. A. Kolesnikov, I. V. Oseledets

TL;DR
This paper introduces an efficient rational Krylov subspace method with adaptive shifts for solving Lyapunov equations with rank-1 right-hand sides, leveraging connections to linear ODEs and low-rank approximation techniques.
Contribution
It presents a novel adaptive shift selection strategy for rational Krylov subspace methods tailored to Lyapunov equations with rank-1 right-hand sides.
Findings
Numerical experiments demonstrate the method's effectiveness.
The approach improves computational efficiency over existing methods.
Adaptive shifts enhance convergence and accuracy.
Abstract
We propose a new method for the approximate solution of the Lyapunov equation with rank- right-hand side, which is based on extended rational Krylov subspace approximation with adaptively computed shifts. The shift selection is obtained from the connection between the Lyapunov equation, solution of systems of linear ODEs and alternating least squares method for low-rank approximation. The numerical experiments confirm the effectiveness of our approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Sparse and Compressive Sensing Techniques · Statistical and numerical algorithms
