A new method for accelerating Arnoldi algorithms for large scale eigenproblems

DOI10.1016/j.matcom.2009.07.009zbMath1177.65051OpenAlexW2037894849WikidataQ56457287 ScholiaQ56457287MaRDI QIDQ1037802

Ravindra Boojhawon, Kumar Dookhitram, Muddun Bhuruth

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

zbMATH Keywords

numerical resultsconvergence accelerationKrylov subspace methoddynamic switchingimplicitly restarted Arnoldi algorithmlarge sparse nonsymmetric eigenvalue problems

Mathematics Subject Classification ID

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

Related Items (2)

Convergence of Arnoldi's method for generalized eigenvalue problems ⋮ A key to choose subspace size in implicitly restarted Arnoldi method

Uses Software

• eigs
• ARPACK
• Harwell-Boeing sparse matrix collection
• IRAM

Cites Work

• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Implicitly Restarted Arnoldi Methods and Subspace Iteration
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Sparse matrix test problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
• ARPACK Users' Guide
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• Analysis of algebraic systems arising from fourth‐order compact discretizations of convection‐diffusion equations
• GMRES with Deflated Restarting
• The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Harmonic projection methods for large non-symmetric eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: A new method for accelerating Arnoldi algorithms for large scale eigenproblems