On the public citation graph

The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems

0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-1506(199709/10)4:5<425::aid-nla117>3.0.co;2-gopenalex-snapshot
An inexact inverse iteration for large sparse eigenvalue problems
inferredcites →https://doi.org/10.1007/0-387-22750-4_4openalex-snapshot
Iterative Methods for Solving Linear Systems
inferredcites →https://doi.org/10.1007/bf01731936openalex-snapshot
Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems
inferredcites →https://doi.org/10.1007/s006070050032openalex-snapshot
On the Convergence Rate of a Preconditioned Subspace Eigensolver
inferredcites →https://doi.org/10.1016/0021-9991(75)90065-0openalex-snapshot
The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
inferredcites →https://doi.org/10.1016/s0024-3795(98)10201-xopenalex-snapshot
The effects of inexact solvers in algorithms for symmetric eigenvalue problems
inferredcites →https://doi.org/10.1090/s0025-5718-02-01435-7openalex-snapshot
Optimal a priori error bounds for the Rayleigh-Ritz method
inferredcites →https://doi.org/10.1137/0712047openalex-snapshot
Solution of Sparse Indefinite Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0719025openalex-snapshot
Inexact Newton Methods
inferredcites →https://doi.org/10.1137/0915004openalex-snapshot
The Davidson Method
inferredcites →https://doi.org/10.1137/1.9781611970937openalex-snapshot
Iterative Methods for Solving Linear Systems
inferredcites →https://doi.org/10.1137/1.9781611971163openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1137/s0036144599363084openalex-snapshot
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
inferredcites →https://doi.org/10.1137/s0895479896311220openalex-snapshot
Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
inferredcites →https://doi.org/10.1137/s1064827597323415openalex-snapshot
Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118597972.ch10openalex-snapshot
Optimization Algorithms
inferred← citeshttps://doi.org/10.1002/gamm.201490038openalex-snapshot
The Jacobi–Davidson method
inferred← citeshttps://doi.org/10.1002/nla.813openalex-snapshot
Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
inferred← citeshttps://doi.org/10.1007/s00211-012-0489-1openalex-snapshot
Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
inferred← citeshttps://doi.org/10.1007/s00894-021-04723-2openalex-snapshot
Fast and accurate procedure to perform SCF or DFT calculation for large molecules
inferred← citeshttps://doi.org/10.1007/s11425-008-0050-yopenalex-snapshot
A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
inferred← citeshttps://doi.org/10.1007/s11425-013-4571-7openalex-snapshot
On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
inferred← citeshttps://doi.org/10.1016/j.cam.2005.10.006openalex-snapshot
A truncated-CG style method for symmetric generalized eigenvalue problems
inferred← citeshttps://doi.org/10.1016/j.cam.2012.05.016openalex-snapshot
On convergence of the inexact Rayleigh quotient iteration with MINRES
inferred← citeshttps://doi.org/10.1016/j.laa.2007.02.013openalex-snapshot
A new justification of the Jacobi–Davidson method for large eigenproblems
inferred← citeshttps://doi.org/10.1016/j.laa.2017.01.018openalex-snapshot
On local quadratic convergence of inexact simplified Jacobi–Davidson method
inferred← citeshttps://doi.org/10.1016/s0021-9991(03)00190-6openalex-snapshot
Computational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matrices
inferred← citeshttps://doi.org/10.1137/100807922openalex-snapshot
Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
inferred← citeshttps://doi.org/10.1137/s0036142902411756openalex-snapshot
Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
inferred← citeshttps://doi.org/10.1137/s0895479803430941openalex-snapshot
Is Jacobi--Davidson Faster than Davidson?
inferred← citeshttps://doi.org/10.1155/2021/2123897openalex-snapshot
A Study on the Convergence Analysis of the Inexact Simplified Jacobi–Davidson Method
inferred← citeshttps://doi.org/10.1360/za2008-38-4-365openalex-snapshot
非精确Rayleigh商迭代和非精确的简化Jacobi-Davidson方法的收敛性分析
inferred← citeshttps://doi.org/10.1515/9781400830244openalex-snapshot
Optimization Algorithms on Matrix Manifolds
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.403-408.5230openalex-snapshot
The Inexact Rayleigh Quotient Iteration for the Large Hermitian Matrix Eigenproblem
inferred← citeshttps://doi.org/10.4208/eajam.160816.131016aopenalex-snapshot
A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.