A new method for accelerating Arnoldi algorithms for large scale eigenproblems
From MaRDI portal
Publication:1037802
DOI10.1016/j.matcom.2009.07.009zbMath1177.65051WikidataQ56457287 ScholiaQ56457287MaRDI QIDQ1037802
Muddun Bhuruth, Kumar Dookhitram, Ravindra Boojhawon
Publication date: 16 November 2009
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2009.07.009
numerical results; convergence acceleration; Krylov subspace method; dynamic switching; implicitly restarted Arnoldi algorithm; large sparse nonsymmetric eigenvalue problems
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Uses Software