Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method

DOI10.1016/S0898-1221(99)00217-5zbMath0942.65037OpenAlexW1980864648MaRDI QIDQ1963131

Yanyan Li

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00217-5

zbMATH Keywords

convergenceeigenvaluesnumerical experimentsNewton methodLanczos algorithmtridiagonal matricessymmetric matricesbisection methodSturm sequencesrecursive partitioning algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (1)

Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method

Uses Software

• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of a refined error bound when updating eigenvalues of tridiagonals
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Eigenvalues of perturbed Hermitian matrices
• How to Implement the Spectral Transformation
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• Estimates for Some Computational Techniques in Linear Algebra
• Solution of eigenvalue problems by sturm sequence method
• Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection

This page was built for publication: Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method