Computing eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation
- 1 December 2018
- journal article
- research article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 343, 363-372
Abstract
No abstract availableKeywords
Funding Information
- Shandong University of Science and Technology (2017RCJJ067)
This publication has 14 references indexed in Scilit:
- On local quadratic convergence of inexact simplified Jacobi–Davidson methodLinear Algebra and its Applications, 2017
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problemsNumerische Mathematik, 2012
- Some modifications of Newton’s method with higher-order convergence for solving nonlinear equationsJournal of Computational and Applied Mathematics, 2009
- Studies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updatesNumerical Linear Algebra with Applications, 2006
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue ProblemsSIAM Journal on Scientific Computing, 2002
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient MethodSIAM Journal on Scientific Computing, 2001
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue ProblemsSIAM Journal on Matrix Analysis and Applications, 1996
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue ProblemsSIAM Journal on Scientific Computing, 1993
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975