Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
DOI10.1137/S0895479896311220zbMATH Open0931.65035MaRDI QIDQ4243497FDOQ4243497
Authors: R. B. Lehoucq, Karl Meerbergen 
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- Approximate Cayley transform methods for inverse eigenvalue problems and convergence analysis
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- An inexact Cayley transform method for inverse eigenvalue problems
- The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues
Cayley transformationgeneralized eigenvalue problemArnoldi methodJacobi-Davidson methodlarge sparse matrixrational Krylov sequence
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (33)
- Numerical simulation of three dimensional pyramid quantum dot
- Optimal quotients for solving large eigenvalue problems
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems
- A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows
- Quadrature methods based on the Cayley transform
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- A new inexact inverse subspace iteration for generalized eigenvalue problems
- Preconditioning eigenvalues and some comparison of solvers
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- On convergence of iterative projection methods for symmetric eigenvalue problems
- Using implicitly filtered RKS for generalised eigenvalue problems
- Improving the Cayley-Hamilton Equation for Low-Rank Transformations
- The nonlinear eigenvalue problem
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- Title not available (Why is that?)
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
- An implicit filter for rational Krylov using core transformations
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- 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 Jacobi-Davidson method
- Inexact methods for the low rank solution to large scale Lyapunov equations
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- Computing function of large matrices by a preconditioned rational Krylov method
- Parallelization of the rational Arnoldi algorithm
- Recursive integral method with Cayley transformation.
Uses Software
This page was built for publication: Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243497)
