A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
From MaRDI portal
Publication:2430753
DOI10.1007/s11075-010-9400-2zbMath1211.65045OpenAlexW1975713539MaRDI QIDQ2430753
Muddun Bhuruth, Kumar Dookhitram, Ashvin Gopaul, Ravindra Boojhawon
Publication date: 8 April 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-010-9400-2
algorithmconvergencenumerical resultseigenvectorKrylov subspace methodrefined Arnoldi methodimplicitly restarted Arnoldi methodresidual boundsnonsymmetric eigenvalue problems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Convergence of algorithms of decomposition type for the eigenvalue problem
- 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
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Implicitly Restarted Arnoldi Methods and Subspace Iteration
- A Krylov--Schur Algorithm for Large Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
