On the public citation graph

The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix

https://doi.org/10.1007/bf01930896
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.1007/bf02252343openalex-snapshot
On the numerical solution of the eigenvalue problem of the laplace operator by a capacitance matrix method
inferredcites →https://doi.org/10.1007/bfb0120698openalex-snapshot
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1073/pnas.35.11.652openalex-snapshot
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
inferredcites →https://doi.org/10.1109/cdc.1974.270490openalex-snapshot
A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matrices
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.2140/pjm.1951.1.233openalex-snapshot
An iterative method for finding characteristic vectors of a symmetric matrix
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems

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-94-011-5412-3_5openalex-snapshot
Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations
inferred← citeshttps://doi.org/10.1007/bf01731929openalex-snapshot
On conjugate gradient-like methods for eigen-like problems
inferred← citeshttps://doi.org/10.1007/s00186-010-0324-3openalex-snapshot
Global infimum of strictly convex quadratic functions with bounded perturbations
inferred← citeshttps://doi.org/10.1007/s00211-015-0699-4openalex-snapshot
Global convergence of the restarted Lanczos and Jacobi–Davidson methods for symmetric eigenvalue problems
inferred← citeshttps://doi.org/10.1007/s10208-005-0179-9openalex-snapshot
Trust-Region Methods on Riemannian Manifolds
inferred← citeshttps://doi.org/10.1016/0045-7949(85)90252-4openalex-snapshot
A subspace lanczos method for the generalized symmetric eigenproblem
inferred← citeshttps://doi.org/10.1016/0377-0427(85)90006-8openalex-snapshot
A survey of Lanczos procedures for very large real ‘symmetric’ eigenvalue problems
inferred← citeshttps://doi.org/10.1016/0771-050x(81)90052-8openalex-snapshot
Lanczos method of tridiagonalization, Jacobi matrices and physics
inferred← citeshttps://doi.org/10.1016/j.cam.2016.08.035openalex-snapshot
On convergence of iterative projection methods for symmetric eigenvalue problems
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00005-8openalex-snapshot
Explicitly restarted Lanczos algorithms in an MPP environment
inferred← citeshttps://doi.org/10.1016/s0898-1221(96)00218-0openalex-snapshot
Evaluation of matrix functions with the block Lanczos algorithm
inferred← citeshttps://doi.org/10.1080/10637199808947378openalex-snapshot
RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES
inferred← citeshttps://doi.org/10.1090/s0025-5718-1979-0521282-9openalex-snapshot
Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
inferred← citeshttps://doi.org/10.1103/physreve.79.036708openalex-snapshot
Implicit restart Lanczos as an eigensolver
inferred← citeshttps://doi.org/10.1109/59.131081openalex-snapshot
Voltage problems on transmission networks subject to unusual power flow patterns
inferred← citeshttps://doi.org/10.1109/59.141754openalex-snapshot
A sparse eigenvalue-based approach for partitioning power networks
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492469openalex-snapshot
Efficient parallel solution of sparse eigenvalue and eigenvector problems
inferred← citeshttps://doi.org/10.1137/0613025openalex-snapshot
Implicit Application of Polynomial Filters in a k -Step Arnoldi Method
inferred← citeshttps://doi.org/10.1137/0904015openalex-snapshot
A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
inferred← citeshttps://doi.org/10.1137/24m1720007openalex-snapshot
Block Cross-Interactive Residual Smoothing for Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides
inferred← citeshttps://doi.org/10.1137/s0895479895290954openalex-snapshot
The Geometry of Algorithms with Orthogonality Constraints
inferred← citeshttps://doi.org/10.1145/237578.237622openalex-snapshot
Parallel implementation of the Lanczos method for sparse matrices
inferred← citeshttps://doi.org/10.1201/9781420028683-10openalex-snapshot
Iterative Methods for the Partial Eigensolution of Symmetric Matrices on Parallel Machines
inferred← citeshttps://doi.org/10.1201/9781420028683.ch5openalex-snapshot
Iterative Methods for the Partial Eigensolution of Symmetric Matrices on Parallel Machines
inferred← citeshttps://doi.org/10.48550/arxiv.2102.03954openalex-snapshot
Large-data determinantal clustering
inferred← citeshttps://doi.org/10.48550/arxiv.physics/9806030openalex-snapshot
The Geometry of Algorithms with Orthogonality Constraints
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.