On the public citation graph

Iteration methods in eigenvalue problems

0 signed · 20 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.1007/978-3-642-66282-9openalex-snapshot
Perturbation Theory for Linear Operators
inferredcites →https://doi.org/10.1007/978-3-662-12678-3openalex-snapshot
Perturbation theory for linear operators
inferredcites →https://doi.org/10.1007/bf01139851openalex-snapshot
Minimization of the computational labor in determining the first eigenvalues of differential operators

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.1893openalex-snapshot
Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
inferred← citeshttps://doi.org/10.1006/jcph.2000.6521openalex-snapshot
An Efficient Method for Band Structure Calculations in 3D Photonic Crystals
inferred← citeshttps://doi.org/10.1007/bf02127702openalex-snapshot
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
inferred← citeshttps://doi.org/10.1016/b978-0-444-50617-7.50010-0openalex-snapshot
Eigenvalue computation in the 20th century
inferred← citeshttps://doi.org/10.1016/j.cma.2020.112911openalex-snapshot
Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses
inferred← citeshttps://doi.org/10.1016/j.laa.2005.06.022openalex-snapshot
A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00239-1openalex-snapshot
A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00461-xopenalex-snapshot
A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00413-1openalex-snapshot
Eigenvalue computation in the 20th century
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01357-6openalex-snapshot
A geometric theory for preconditioned inverse iteration applied to a subspace
inferred← citeshttps://doi.org/10.1137/050631574openalex-snapshot
Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
inferred← citeshttps://doi.org/10.1137/060661910openalex-snapshot
Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
inferred← citeshttps://doi.org/10.1137/080725532openalex-snapshot
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics
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.1145/1731022.1731031openalex-snapshot
PRIMME
inferred← citeshttps://doi.org/10.1145/2833258.2833305openalex-snapshot
Unsupervised Anomaly Detection in Online Game
inferred← citeshttps://doi.org/10.1515/1569398054308676openalex-snapshot
Variable-step preconditioned conjugate gradient method for partial 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.