scientific article; zbMATH DE number 1138094
The paper is focused on the computation of the smallest modulus eigenvalue \(\lambda_n\) and its associated eigenvector for a large sparse \(n\times n\) matrix \(A\). In the classical inverse iteration method (INVIT), the solution \(v_{k+1}\) of an auxiliary inner problem \(Av_{k+1}=u_k\) is used to calculate a value \(\beta_{k+1}\) and a vector \(u_{k+1}\) tending, if \(k\to \infty \), to \(\lambda_n^{-1}\) and to the \(\lambda_n\)-associated eigenvector. The authors propose to solve the inner problem iteratively with a tolerance \(\varepsilon_k\) dependent on \(\beta_{k}\), \(\varepsilon_{k-1}\), and \(\lambda_{n-1}\), i.e., the eigenvalue with the second smallest modulus. It is proved that if the eigenvalues of \(A\) are linearly independent, \({|}\lambda_{n-1}{|}>{|}\lambda_n{|}\), and a starting vector \(u_0\) fulfills certain assumption, then the proposed algorithm converges linearly. Moreover, the authors derive two practical formulae to get rid of \(\lambda_{n-1}\) and to make the calculation of \(\varepsilon_k\) simple. They also introduce a modified algorithm for solving generalized eigenvalue problems. Three numerical experiments are presented. They show that the inexact inverse iteration method saves at least half the computational cost if compared with INVIT.
- scientific article; zbMATH DE number 1439304
- Inexact inverse iteration for generalized eigenvalue problems
- Acceleration of inexact inverse iteration for eigenvalue problems
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- On finding robust approximate inverses for large sparse matrices
- A refined subspace iteration algorithm for large sparse eigenproblems
- scientific article; zbMATH DE number 3940609
- A new inexact inverse subspace iteration for generalized eigenvalue problems
- Iterative projection methods for sparse nonlinear eigenproblems
- Optimal iterate of the power and inverse iteration methods
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
- Fixed-point methods for a semiconductor quantum dot model
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- A refined subspace iteration algorithm for large sparse eigenproblems
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials
- Computing the smallest singular triplets of a large matrix
- A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
- On expansion of search subspaces for large non-Hermitian eigenproblems
- Acceleration of inexact inverse iteration for eigenvalue problems
- A restarted Krylov method with inexact inversions
- scientific article; zbMATH DE number 1500885 (Why is no real title available?)
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- A new inexact inverse subspace iteration for generalized eigenvalue problems
- scientific article; zbMATH DE number 1844154 (Why is no real title available?)
- scientific article; zbMATH DE number 1439304 (Why is no real title available?)
- Low-rank solution methods for stochastic eigenvalue problems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
- Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
- Inexact Inverse Iteration with Variable Shift for Nonsymmetric Generalized Eigenvalue Problems
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Saving flops in LU based shift-and-invert strategy
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383439)