Adapting the Lanczos algorithm to matrices with almost continuous spectra
J\"orn Zimmerling, Vladimir Druskin

TL;DR
This paper adapts the Lanczos algorithm to better approximate matrices with dense, continuous spectra, improving efficiency and accuracy in large-scale PDE discretizations, especially for wave propagation problems.
Contribution
It introduces a quadratic terminator using Kren--Nudelman semi-infinite strings to model the continuous spectral measure more effectively than traditional Krylov methods.
Findings
Significant error reductions in PDE discretizations
Enhanced computation of MIMO transfer functions
Improved wave propagation simulations
Abstract
We consider the approximation of where is large, symmetric positive definite, and has a dense spectrum, and , . Our target application is the computation of Multiple-Input Multiple-Output transfer functions arising from large-scale discretizations of problems with continuous spectral measures, such as linear time-invariant PDEs on unbounded domains. Traditional Krylov methods, such as Lanczos or conjugate gradients, focus on resolving individual eigenvalues of a dense discretization, while ignoring the underlying continuous spectral measure that these points approximate. We argue that it is more efficient to model the inherent branch cut of the original operator than to exhaustively resolve the artificial point spectrum induced by discretization. We place this problem in a framework, known in the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Model Reduction and Neural Networks · Quantum many-body systems
