On local quadratic convergence of inexact simplified Jacobi–Davidson method
Authors:
- Zhong-Zhi BaiZBZhong-Zhi Bai
- Cun-Qiang MiaoCMCun-Qiang Miao
- 1 May 2017
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 520, 215-241
Abstract
No abstract availableFunding Information
- National Key Research and Development Program of China (2011CB309703)
- National Natural Science Foundation of China (11321061)
- National Natural Science Foundation of China (91118001)
- National Natural Science Foundation of China (11671393)
This publication has 12 references indexed in Scilit:
- Motivations and realizations of Krylov subspace methods for large sparse linear systemsJournal of Computational and Applied Mathematics, 2015
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problemsNumerische Mathematik, 2012
- Inexact inverse subspace iteration for generalized eigenvalue problemsLinear Algebra and its Applications, 2010
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme EigenvalueSIAM Journal on Numerical Analysis, 2008
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblemsNumerical Linear Algebra with Applications, 2002
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue ProblemsSIAM Journal on Scientific Computing, 2002
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer IterationSIAM Journal on Scientific Computing, 1999
- The effects of inexact solvers in algorithms for symmetric eigenvalue problemsLinear Algebra and its Applications, 1999
- Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblemsBIT Numerical Mathematics, 1996
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue ProblemsSIAM Journal on Matrix Analysis and Applications, 1996