Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
From MaRDI portal
Publication:4243497
DOI10.1137/S0895479896311220zbMath0931.65035MaRDI QIDQ4243497
Richard B. Lehoucq, Karl Meerbergen
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
generalized eigenvalue problemJacobi-Davidson methodArnoldi methodCayley transformationlarge sparse matrixrational Krylov sequence
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (27)
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems ⋮ Backward error analysis of the shift-and-invert Arnoldi algorithm ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem ⋮ A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows ⋮ Numerical simulation of three dimensional pyramid quantum dot ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems ⋮ A new justification of the Jacobi-Davidson method for large eigenproblems ⋮ The nonlinear eigenvalue problem ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices ⋮ Inexact inverse subspace iteration for generalized eigenvalue problems ⋮ Parallelization of the Rational Arnoldi Algorithm ⋮ Inexact methods for the low rank solution to large scale Lyapunov equations ⋮ Optimal quotients for solving large eigenvalue problems ⋮ Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations ⋮ Computing Function of Large Matrices by a Preconditioned Rational Krylov Method ⋮ Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems ⋮ The Jacobi-Davidson method ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ Deflation by restriction for the inverse-free preconditioned Krylov subspace method ⋮ Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations ⋮ Unnamed Item ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems ⋮ Using implicitly filtered RKS for generalised eigenvalue problems ⋮ Preconditioning eigenvalues and some comparison of solvers
Uses Software
This page was built for publication: Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
