Fast Toeplitz eigenvalue computations, joining interpolation-extrapolation matrix-less algorithms and simple-loop conjectures: the preconditioned setting
Manuel Bogoya, Stefano Serra-Cappizano, Paris Vassalos

TL;DR
This paper develops new matrix-less algorithms for fast eigenvalue computation of preconditioned Toeplitz matrices, extending simple-loop theory and achieving high precision with linear complexity.
Contribution
It introduces novel algorithms for preconditioned Toeplitz eigenvalues, based on variable change and asymptotic expansion, with improved accuracy and efficiency.
Findings
Numerical experiments show higher precision up to machine accuracy.
Algorithms maintain linear computational complexity.
Extension of simple-loop theory to preconditioned matrices.
Abstract
Under appropriate technical assumptions, the simple-loop theory allows to deduce various types of asymptotic expansions for the eigenvalues of Toeplitz matrices generated by a function , unfortunately, such a theory is not available in the preconditioning setting, that is for matrices of the form with real-valued, nonnnegative and not identically zero almost everywhere. Independently and under the milder hypothesis that is even and monotonic over , matrix-less algorithms have been developed for the fast eigenvalue computation of large preconditioned matrices of the type above, within a linear complexity in the matrix order: behind the high efficiency of such algorithms there are the expansions as in the case , combined with the extrapolation idea, and hence we conjecture that the simple-loop theory has…
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 · Electromagnetic Scattering and Analysis · Finite Group Theory Research
