An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems

DOI10.1016/S0096-3003(03)00655-6zbMath1054.65035OpenAlexW1987373851MaRDI QIDQ1827036

Gang Wu

Publication date: 6 August 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(03)00655-6

zbMATH Keywords

algorithmconvergenceeigenvalue problemnumerical experimentsRitz valuesparallel processingKrylov subspace methodsorthogonal projectionmultiple eigenvaluesRitz vectorsBlock Arnoldi method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (4)

A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A new technique for determining coupled modes of structure-acoustic systems ⋮ A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ On a new variant of Arnoldi method for approximation of eigenpairs

Uses Software

• eigs
• Harwell-Boeing sparse matrix collection
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
• Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• A refined subspace iteration algorithm for large sparse eigenproblems
• Absolute and relative perturbation bounds for invariant subspaces of matrices
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Sparse matrix test problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems