A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
type: Item
instance of: scholarly article
title: A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
zbMATH Open document ID: 1415.65120
author: Tao Zhao
published in: Journal of Scientific Computing
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 65H17
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A22
zbMATH DE Number: 6902224
zbMATH Keywords: polynomial eigenvalue problem
zbMATH Keywords: Jacobi-Davidson algorithm
zbMATH Keywords: convergence analysis
zbMATH Keywords: inexact correction equation solver
zbMATH Keywords: simple eigenvalue
describes a project that uses: PETSc
describes a project that uses: MatrixMarket
describes a project that uses: NLEVP
describes a project that uses: SLEPc
describes a project that uses: JDQZ
MaRDI profile type: Publication
full work available at URL: s10915-017-0582-9
OpenAlex ID: W2765301140
cites work: A numerical method for polynomial eigenvalue problems using contour integral
cites work: NLEVP
cites work: An integral method for solving nonlinear eigenvalue problems
cites work: A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems
cites work: A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
cites work: Chebyshev interpolation for nonlinear eigenvalue problems
cites work: Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
cites work: Q5689624
cites work: Algebraic domain decomposition methods for highly heterogeneous problems
cites work: Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem
cites work: Controlling Inner Iterations in the Jacobi–Davidson Method
cites work: A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
cites work: A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
cites work: Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
cites work: Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
cites work: Nonlinear Rayleigh-Ritz iterative method for solving large scale nonlinear eigenvalue problems
cites work: A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations
cites work: Rational Krylov sequence methods for eigenvalue computation
cites work: Q4414854
cites work: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
cites work: Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
cites work: Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems. I. Classical algorithms
cites work: Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems: II. Accelerated algorithms
cites work: Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
cites work: Q4825126
cites work: Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
cites work: A new justification of the Jacobi-Davidson method for large eigenproblems
cites work: A spectral analysis of subspace enhanced preconditioners
cites work: Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation
DOI: 10.1007/S10915-017-0582-9
description: scientific article; zbMATH DE number 6902224