A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems

DOI10.1137/21M1401474MaRDI QIDQ5057768

Maseim Kenmoe, Matteo Smerlak, Ronald Kriemann, A. S. Zadorin

Publication date: 19 December 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14702

zbMATH Keywords

perturbation theoryiterative methodeigenvalue algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

IterativePerturbationTheory.jl

Uses Software

• SLEPc
• JDQR
• PRIMME
• ARPACK
• JDQZ
• Julia
• Anderson
• PySCF

Cites Work

• Unnamed Item
• Unnamed Item
• PRIMME
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Preconditioning eigenvalues and some comparison of solvers
• Perturbation theory for linear operators.
• A comparative study on methods for convergence acceleration of iterative vector sequences
• Julia: A Fresh Approach to Numerical Computing
• Anderson Acceleration for Fixed-Point Iterations
• The vectorization of ITPACK 2C
• SLEPc
• Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• ARPACK Users' Guide
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• Simple mathematical models with very complicated dynamics

This page was built for publication: A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems