Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems

DOI10.1016/S0024-3795(96)00238-8zbMath0877.65018MaRDI QIDQ1362621

Zhongxiao Jia

Publication date: 5 August 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical experimentseigenvectorssingular value decompositionsRitz vectorsselected eigenvaluesArnoldi's methodlarge unsymmetric matricesArnoldi-Chebyshev algorithmsrefined algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Acceleration of the generalized FOM algorithm for computing PageRank, Acceleration of an adaptive generalized Arnoldi method for computing PageRank, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Data Driven Modal Decompositions: Analysis and Enhancements, An orthogonally accumulated projection method for symmetric linear system of equations, On refined Ritz vectors and polynomial characterization, Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues, A GMRES-power algorithm for computing PageRank problems, An Arnoldi-type algorithm for computing Page Rank, Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems, A new extrapolation method for PageRank computations, A relaxed two-step splitting iteration method for computing PageRank, Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices, The modified matrix splitting iteration method for computing PageRank problem, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank, The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, Hybrid iterative refined restarted Lanczos bidiagonalization methods, An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank, FOM accelerated by an extrapolation method for solving PageRank problems, A new shift strategy for the implicitly restarted refined harmonic Lanczos method, A refined Arnoldi type method for large scale eigenvalue problems, The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs, A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining, A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems, On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems, A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems., Implicitly Restarted Refined Partially Orthogonal Projection Method with Deflation, An analysis of the Rayleigh--Ritz method for approximating eigenspaces, An adaptive Power-GArnoldi algorithm for computing PageRank, A two-step matrix splitting iteration for computing PageRank, Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method, On a new variant of Arnoldi method for approximation of eigenpairs, A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems, Irr: An algorithm for computing the smallest singular value of large scale matrices, Optimal expansion of subspaces for eigenvector approximations, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, On adaptively accelerated Arnoldi method for computing PageRank, A Jacobi-Davidson type method for the product eigenvalue problem, Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems, A refined Jacobi-Davidson method and its correction equation, The general inner-outer iteration method based on regular splittings for the PageRank problem, The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors, Residuals of refined projection methods for large matrix eigenproblems, An Arnoldi-extrapolation algorithm for computing pagerank, The Jacobi-Davidson method, Fast eigenvalue calculations in a massively parallel plasma turbulence code, A new variant of Arnoldi method for approximation of eigenpairs, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, Adaptive finite element solution of eigenvalue problems: Balancing of discretization and iteration error, Convergence of Arnoldi's method for generalized eigenvalue problems, PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations, Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems, A Jacobi-Davidson type method for the generalized singular value problem, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems, A new method for accelerating Arnoldi algorithms for large scale eigenproblems, A general multi-splitting iteration method for computing PageRank, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM, Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems, Composite orthogonal projection methods for large matrix 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, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm, The coupled iteration algorithms for computing PageRank, A Hessenberg-type algorithm for computing PageRank problems

Uses Software

• eigs
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Large-scale complex eigenvalue problems
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• Tchebychev acceleration technique for large scale nonsymmetric matrices
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem