On the public citation graph
Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01600502openalex-snapshot
Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
inferredcites →https://doi.org/10.1090/s0002-9904-1961-10708-8openalex-snapshot
An inequality for linear transformations with eigenvalues
inferredcites →https://doi.org/10.1093/comjnl/8.1.77openalex-snapshot
Convergence of the LR, QR, and Related Algorithms
inferredcites →https://doi.org/10.1093/comjnl/8.3.273openalex-snapshot
The calculation of Lame polynomials
inferredcites →https://doi.org/10.1112/jlms/s1-40.1.378bopenalex-snapshot
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
inferredcites →https://doi.org/10.2307/2314680openalex-snapshot
The Theory of Matrices in Numerical Analysis.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3394openalex-snapshot
An optimized and scalable eigensolver for sequences of eigenvalue problems
inferred← citeshttps://doi.org/10.1002/nla.2607openalex-snapshot
Angle‐Free Cluster‐Robust Ritz Value Bounds for Restarted Block Eigensolvers
inferred← citeshttps://doi.org/10.1007/978-0-8176-4968-5_8openalex-snapshot
The SVD, Eigenproblem, and Invariant Subspaces: Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-5669-5_2openalex-snapshot
A Distributed Algorithm for Content Based Indexing of Images by Projections on Ritz Primary Images
inferred← citeshttps://doi.org/10.1007/978-3-642-86940-2_20openalex-snapshot
Simultaneous Iteration Method for Symmetric Matrices
inferred← citeshttps://doi.org/10.1007/978-3-662-39778-7_20openalex-snapshot
Simultaneous Iteration Method for Symmetric Matrices
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_11openalex-snapshot
Large Symmetric Eigenvalue Problems
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01462265openalex-snapshot
Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
inferred← citeshttps://doi.org/10.1007/bf01932692openalex-snapshot
On the intermediate eigenvalues of symmetric sparse matrices
inferred← citeshttps://doi.org/10.1007/bf02219773openalex-snapshot
Simultaneous iteration method for symmetric matrices
inferred← citeshttps://doi.org/10.1007/s10208-020-09479-4openalex-snapshot
Tensor-Free Proximal Methods for Lifted Bilinear/Quadratic Inverse Problems with Applications to Phase Retrieval
inferred← citeshttps://doi.org/10.1007/s10851-021-01019-1openalex-snapshot
Robust PCA via Regularized Reaper with a Matrix-Free Proximal Algorithm
inferred← citeshttps://doi.org/10.1016/0024-3795(77)90018-0openalex-snapshot
Simultaneous iteration for the matrix eigenvalue problem
inferred← citeshttps://doi.org/10.1016/0045-7825(78)90093-2openalex-snapshot
On the efficient and accurate solution of the skew-symmetric eigenvalue problem
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90070-1openalex-snapshot
Using parallel banded linear system solvers in generalized eigenvalue problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50012-xopenalex-snapshot
A BIBLIOGRAPHICAL TOUR OF THE LARGE, SPARSE GENERALIZED EIGENVALUE PROBLEM
inferred← citeshttps://doi.org/10.1016/b978-0-12-496952-0.50023-4openalex-snapshot
Methods of Simultaneous Iteration for Calculating Eigenvectors of Matrices
inferred← citeshttps://doi.org/10.1016/j.cam.2011.06.003openalex-snapshot
On the modification of an eigenvalue problem that preserves an eigenspace
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.04.004openalex-snapshot
Incremental manifold learning by spectral embedding methods
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10029-0openalex-snapshot
Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
inferred← citeshttps://doi.org/10.1016/s0168-9274(99)00008-2openalex-snapshot
A refined subspace iteration algorithm for large sparse eigenproblems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00391-5openalex-snapshot
The trace minimization method for the symmetric generalized eigenvalue problem
inferred← citeshttps://doi.org/10.1021/acs.jctc.2c00435openalex-snapshot
Full Configuration Interaction Excited-State Energies in Large Active Spaces from Subspace Iteration with Repeated Random Sparsification
inferred← citeshttps://doi.org/10.1023/a:1009725401947openalex-snapshot
A Distributed Algorithm for Content Based Indexing of Images by Projections on Ritz Primary Images
inferred← citeshttps://doi.org/10.1080/10637199708915600openalex-snapshot
THE PARALLEL COMPUTATION OF PARTIAL EIGENSOLUTIONS USING A MODIFIED LANCZOS METHOD
inferred← citeshttps://doi.org/10.1090/s0025-5718-1979-0537973-xopenalex-snapshot
Estimating the largest eigenvalue of a positive definite matrix
inferred← citeshttps://doi.org/10.1109/9.341817openalex-snapshot
Computation of approximate null vectors of Sylvester and Lyapunov operators
inferred← citeshttps://doi.org/10.1109/iccv.1998.710711openalex-snapshot
Computing Ritz approximations of primary images
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
inferred← citeshttps://doi.org/10.1137/1015095openalex-snapshot
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
inferred← citeshttps://doi.org/10.1137/18m1180827openalex-snapshot
A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition
inferred← citeshttps://doi.org/10.1137/18m122100xopenalex-snapshot
Low-Rank Solution Methods for Stochastic Eigenvalue Problems
inferred← citeshttps://doi.org/10.1137/21m1422513openalex-snapshot
Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification
inferred← citeshttps://doi.org/10.1137/s0895479899358595openalex-snapshot
Implicitly Restarted Arnoldi Methods and Subspace Iteration
inferred← citeshttps://doi.org/10.4236/alamt.2015.53008openalex-snapshot
A Subspace Iteration for Calculating a Cluster of Exterior Eigenvalues
inferred← citeshttps://doi.org/10.4236/alamt.2020.102002openalex-snapshot
The Equivalence between Orthogonal Iterations and Alternating Least Squares
inferred← citeshttps://doi.org/10.48550/arxiv.1805.10121openalex-snapshot
ChASE: Chebyshev Accelerated Subspace iteration Eigensolver for sequences of Hermitian eigenvalue problems
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01188openalex-snapshot
Incrementally Updated Spectral Embeddings
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.