Modified explicitly restarted Lanczos algorithm

DOI10.1016/S0010-4655(97)00136-7zbMath0931.65037MaRDI QIDQ1299581

V. Pereyra

Publication date: 23 February 2000

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencecomparison of methodsnumerical exampleseigenvaluesconvergence accelerationeigenvectorslarge sparse matricesrestarted Lanczos methodDavidson algorithmHubbard chains

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Scaled unscented transform Gaussian sum filter: theory and application ⋮ A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices

Cites Work

• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
• Unnamed Item

This page was built for publication: Modified explicitly restarted Lanczos algorithm