Preconditioning eigenvalues and some comparison of solvers
From MaRDI portal
Publication:1591177
DOI10.1016/S0377-0427(00)00395-2zbMath0979.65028MaRDI QIDQ1591177
Publication date: 10 February 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergencenumerical examplespreconditioningeigenvalue problemscomparisonsRayleigh quotient iterationDavidson methods
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems ⋮ Block subspace projection preconditioned conjugate gradient method in modal structural analysis ⋮ Inverse differential quadrature solutions for free vibration of arbitrary shaped laminated plate structures ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ The Jacobi-Davidson method ⋮ Fast eigenvalue calculations in a massively parallel plasma turbulence code ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems ⋮ Preconditioning techniques for large linear systems: A survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Davidson's method and preconditioning for generalized eigenvalue problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Iterative eigenvalue algorithms based on convergent splittings
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Further results on the convergence behavior of conjugate-gradients and Ritz values
- Matrix eigensystem routines - EISPACK guide
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Criteria for Combining Inverse and Rayleigh Quotient Iteration
- Sparse matrix test problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- The Davidson Method
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Choosing the Forcing Terms in an Inexact Newton Method
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- The method of conjugate gradients used in inverse iteration
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
