On preconditioned eigensolvers and invert-Lanczos processes
convergencepreconditioningsmallest eigenvalueRayleigh quotientelliptic eigenvalue problemKrylov subspace iterationsLanczos methods
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Estimates of eigenvalues in context of PDEs (35P15) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
- Preconditioning by inverting the Laplacian: an analysis of the eigenvalues
- On the eigenvalue distribution of a class of preconditioning methods
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems
- Additive preconditioning, eigenspaces, and the inverse iteration
- Preconditioning for eigenproblems
- Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems
- Preconditioners in spectral approximation
- Preconditioning eigenvalues and some comparison of solvers
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Inexact inverse subspace iteration with preconditioning applied to non-Hermitian eigenvalue problems
- scientific article; zbMATH DE number 440637 (Why is no real title available?)
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- scientific article; zbMATH DE number 919117 (Why is no real title available?)
- scientific article; zbMATH DE number 4197271 (Why is no real title available?)
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3231501 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Algebraic multigrid methods for solving generalized eigenvalue problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Estimates for Some Computational Techniques in Linear Algebra
- Exact estima tes for the rate of convergence of the s-step method of steepest descent in eigenvalue problems
- Further results on the convergence behavior of conjugate-gradients and Ritz values
- Is Jacobi--Davidson Faster than Davidson?
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Numerical methods for large eigenvalue problems
- On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Preconditioning eigensolvers -- an Oxymoron?
- Preconditioning indefinite discretization matrices
- Preconditioning of Indefinite and Almost Singular Finite Element Elliptic Equations
- Rational Krylov sequence methods for eigenvalue computation
- Strict estimates of the rate of convergence of an iterative method of computing eigenvalues
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- The site of termination of afferent fibres in the caudate nucleus
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- On the eigenvalue distribution of a class of preconditioning methods
- Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
- The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- On the convergence rate of a preconditioned subspace eigensolver
- Convergence analysis of restarted Krylov subspace eigensolvers
- Algebraic multigrid preconditioning for iterative eigensolvers
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- An unconstrained global optimization framework for real symmetric eigenvalue problems
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
This page was built for publication: On preconditioned eigensolvers and invert-Lanczos processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999788)