A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
type: Item
instance of: scholarly article
title: A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
zbMATH Open document ID: 1035.65036
DOI: 10.1016/S0898-1221(02)00220-1
author: Zhongxiao Jia
author: Yong Zhang
publication date: 2003-12-14T00:00:00Z
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 2017133
zbMATH Keywords: Large generalized eigenproblem
zbMATH Keywords: Matrix pair
zbMATH Keywords: Shift-and-invert
zbMATH Keywords: Arnoldi method
zbMATH Keywords: Refined Arnoldi method
zbMATH Keywords: Ritz value
zbMATH Keywords: Ritz vector
zbMATH Keywords: Convergence
zbMATH Keywords: comparison of methods
zbMATH Keywords: eigenvalues
zbMATH Keywords: eigenvectors
zbMATH Keywords: singular value decompositions
zbMATH Keywords: algorithm
zbMATH Keywords: numerical examples
describes a project that uses: Partial Differential Equation Toolbox
MaRDI profile type: Publication
cites work: Numerical methods for large eigenvalue problems
cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
cites work: A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
cites work: Rational Krylov sequence methods for eigenvalue computation
cites work: Q4309413
cites work: Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
cites work: The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
cites work: Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
cites work: The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
cites work: Composite orthogonal projection methods for large matrix eigenproblems
cites work: An analysis of the Rayleigh-Ritz method for approximating eigenspaces
cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
cites work: A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
cites work: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
cites work: A refined subspace iteration algorithm for large sparse eigenproblems
cites work: Residuals of refined projection methods for large matrix eigenproblems
cites work: The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
cites work: Matrix algorithms. Vol. 2: Eigensystems
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2017133