A refined Arnoldi type method for large scale eigenvalue problems
type: Item
instance of: scholarly article
title: A refined Arnoldi type method for large scale eigenvalue problems
zbMATH Open document ID: 1264.65057
author: Xiang Wang
author: Qiang Niu
author: Linzhang Lu
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2013-03-15T00:00:00Z
review text: The authors propose a refined Arnoldi-type method for extracting partial eigenpairs of large matrices. They also provide a convergence analysis of the method, together with comparative numerical experiments.
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 6145357
zbMATH Keywords: Harmonic Ritz values
zbMATH Keywords: Ritz values
zbMATH Keywords: eigenvalue problem
zbMATH Keywords: Arnoldi process
zbMATH Keywords: Rayleigh-Ritz method
zbMATH Keywords: eigenpairs
zbMATH Keywords: convergence
zbMATH Keywords: numerical experiments
reviewed by: Constantin Popa
describes a project that uses: JDQZ
describes a project that uses: MatrixMarket
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
full work available at URL: s13160-012-0090-0
OpenAlex ID: W2049348304
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
cites work: An analogue of the results of Saad and Stewart for harmonic Ritz vectors
cites work: A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
cites work: Sparse matrix test problems
cites work: Analysis of acceleration strategies for restarted minimal residual methods
cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
cites work: An analysis of the Rayleigh-Ritz method for approximating eigenspaces
cites work: The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
cites work: A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
cites work: Computing interior eigenvalues of large matrices
cites work: Harmonic projection methods for large non-symmetric eigenvalue problems
cites work: An invert-free Arnoldi method for computing interior eigenpairs of large matrices
cites work: Approximate solutions and eigenvalue bounds from Krylov subspaces
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
cites work: Numerical methods for large eigenvalue problems
cites work: The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
cites work: An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
cites work: Q4463175
cites work: Matrix algorithms. Vol. 2: Eigensystems
cites work: A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
cites work: A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
cites work: Computational methods for large eigenvalue problems
cites work: A simpler GMRES
DOI: 10.1007/S13160-012-0090-0
description: scientific article; zbMATH DE number 6145357