A compressed Lanczos algorithm solves large symmetric Lyapunov equations using only a few stored vectors, with error bounds showing the compression costs almost nothing.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lanczos with compression for symmetric matrix Lyapunov equations
A compressed Lanczos algorithm solves large symmetric Lyapunov equations using only a few stored vectors, with error bounds showing the compression costs almost nothing.