A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems

DOI10.1007/s10915-017-0582-9zbMath1415.65120OpenAlexW2765301140MaRDI QIDQ1651310

Tao Zhao

Publication date: 12 July 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-017-0582-9

zbMATH Keywords

convergence analysispolynomial eigenvalue problemsimple eigenvalueJacobi-Davidson algorithminexact correction equation solver

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Matrix pencils (15A22)

Uses Software

• SLEPc
• PETSc
• MatrixMarket
• NLEVP
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral analysis of subspace enhanced preconditioners
• An integral method for solving nonlinear eigenvalue problems
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
• Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
• A numerical method for polynomial eigenvalue problems using contour integral
• Chebyshev interpolation for nonlinear eigenvalue problems
• Rational Krylov sequence methods for eigenvalue computation
• Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
• A new justification of the Jacobi-Davidson method for large eigenproblems
• A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
• Nonlinear Rayleigh-Ritz iterative method for solving large scale nonlinear eigenvalue problems
• A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
• Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
• Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems. I. Classical algorithms
• Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems: II. Accelerated algorithms
• Algebraic Domain Decomposition Methods for Highly Heterogeneous Problems
• A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations
• NLEVP
• Controlling Inner Iterations in the Jacobi–Davidson Method
• Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem
• A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems
• Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems

This page was built for publication: A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems