The method of conjugate gradients used in inverse iteration
From MaRDI portal
Publication:5683631
DOI10.1007/BF01932964zbMath0266.65033MaRDI QIDQ5683631
Publication date: 1972
Published in: BIT (Search for Journal in Brave)
Related Items
A minimization method for the solution of large symmetriric eigenproblems, A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices, Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators, Accelerating large partial EVD/SVD calculations by filtered block Davidson methods, Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices, Convergence of inexact inverse iteration with application to preconditioned iterative solvers, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Computational methods of linear algebra, Inexact inverse subspace iteration for generalized eigenvalue problems, Iterative eigenvalue algorithms based on convergent splittings, Inexact inverse iteration for symmetric matrices, Unnamed Item, On preconditionad iterative methods for solving (A-lambdaB)x=0, Preconditioning eigenvalues and some comparison of solvers, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
Cites Work
- Unnamed Item
- On the asymptotic directions of the s-dimensional optimum gradient method
- New iterative methods for solution of the eigenproblem
- An iterative method for finding characteristic vectors of a symmetric matrix
- Gradient methods for finite-element eigenproblems.
- Hyperbolic Pairs in the Method of Conjugate Gradients
- The Rotation of Eigenvectors by a Perturbation. III
- Practical use of the symmetric Lanczos process with re-orthogonalization
- Methods of conjugate gradients for solving linear systems
