On the public citation graph

Invariant subspaces for tightly clustered eigenvalues of tridiagonals

0 signed · 27 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/bf01405565openalex-snapshot
The numerically stable reconstruction of Jacobi matrices from spectral data
inferredcites →https://doi.org/10.1007/s002110050132openalex-snapshot
On close eigenvalues of tridiagonal matrices
inferredcites →https://doi.org/10.1115/1.3157781openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1137/1.9781611971163openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.21236/ada327490openalex-snapshot
The Construction of Orthogonal Eigenvectors for Tight Clusters by Use of Submatrices,
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-49887-4_4openalex-snapshot
Localization in Matrix Computations: Theory and Applications
inferred← citeshttps://doi.org/10.1016/j.apnum.2011.09.010openalex-snapshot
Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
inferred← citeshttps://doi.org/10.1016/j.apnum.2014.04.010openalex-snapshot
On eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00330-5openalex-snapshot
The Orthogonal Rayleigh Quotient Iteration (ORQI) method
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00398-6openalex-snapshot
An O(n2) algorithm for the bidiagonal SVD
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00022-0openalex-snapshot
Fernando's Solution to Wilkinson's Problem: An Application of Double Factorization
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00204-9openalex-snapshot
Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner–outer iterations
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00404-0openalex-snapshot
An overview of relative sinΘ theorems for invariant subspaces of complex matrices
inferred← citeshttps://doi.org/10.1017/s096249290626001xopenalex-snapshot
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
inferred← citeshttps://doi.org/10.1134/s0965542508070026openalex-snapshot
On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix
inferred← citeshttps://doi.org/10.1137/040608635openalex-snapshot
Graph Clustering Via a Discrete Uncoupling Process
inferred← citeshttps://doi.org/10.1137/040608908openalex-snapshot
On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
inferred← citeshttps://doi.org/10.1137/040620746openalex-snapshot
Glued Matrices and the MRRR Algorithm
inferred← citeshttps://doi.org/10.1137/050628301openalex-snapshot
Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
inferred← citeshttps://doi.org/10.1137/09077624xopenalex-snapshot
Detecting Localization in an Invariant Subspace
inferred← citeshttps://doi.org/10.1137/100814019openalex-snapshot
Decay Properties of Spectral Projectors with Applications to Electronic Structure
inferred← citeshttps://doi.org/10.1137/110834020openalex-snapshot
A Framework for the $MR^3$ Algorithm: Theory and Implementation
inferred← citeshttps://doi.org/10.1137/20m1327343openalex-snapshot
Eigenpairs of Wilkinson Matrices
inferred← citeshttps://doi.org/10.1137/s0895479800370111openalex-snapshot
Orthogonal Eigenvectors and Relative Gaps
inferred← citeshttps://doi.org/10.3390/math10193636openalex-snapshot
A Modified Inverse Iteration Method for Computing the Symmetric Tridiagonal Eigenvectors
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4950openalex-snapshot
MRRR-based Eigensolvers for Multi-core Processors and Supercomputers
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.