On the public citation graph
The method of coordinate overrelaxation for (A??B)x=0
0 signed · 44 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.1002/zamm.19730530202openalex-snapshot
Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
inferredcites →https://doi.org/10.1007/978-3-642-86940-2openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/978-3-663-11341-6openalex-snapshot
Numerik symmetrischer Matrizen
inferredcites →https://doi.org/10.1007/bf02162089openalex-snapshot
New iterative methods for solution of the eigenproblem
inferredcites →https://doi.org/10.1016/0021-9991(70)90010-0openalex-snapshot
Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
inferredcites →https://doi.org/10.1016/0021-9991(70)90014-8openalex-snapshot
An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
inferredcites →https://doi.org/10.1016/0021-9991(72)90055-1openalex-snapshot
Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices
inferredcites →https://doi.org/10.1016/0021-9991(73)90149-6openalex-snapshot
The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
inferredcites →https://doi.org/10.1016/0045-7825(74)90039-5openalex-snapshot
The eigenvalue problem for symmetric matrices of high order
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1063/1.1696477openalex-snapshot
Algorithm for Diagonalization of Large Matrices
inferredcites →https://doi.org/10.1137/0702022openalex-snapshot
On the Solution of Singular and Semidefinite Linear Systems by Iteration
inferredcites →https://doi.org/10.1137/0709056openalex-snapshot
On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.2307/2005673openalex-snapshot
Handbook for Automatic Computation. Vol II, Linear Algebra
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.70016openalex-snapshot
Admissibly Randomized Coordinate Descent Methods for Computing Extreme Eigenpairs of Symmetric Matrices
inferred← citeshttps://doi.org/10.1002/nme.1620201209openalex-snapshot
Solution of the partial eigenproblem by iterative methods
inferred← citeshttps://doi.org/10.1002/zamm.19770571005openalex-snapshot
Zur Konvergenz der Koordinatenrelaxation für Ax = λBx
inferred← citeshttps://doi.org/10.1006/jsvi.2001.4102openalex-snapshot
COMPUTING THE LOWEST EIGENVALUE WITH RAYLEIGH QUOTIENT ITERATION
inferred← citeshttps://doi.org/10.1007/978-3-0348-5328-6_14openalex-snapshot
Praktische Erfahrungen mit Varianten der Koordinatenueberrelaxation zur Loesung von Eigenwertaufgaben
inferred← citeshttps://doi.org/10.1007/978-3-0348-7694-0_12openalex-snapshot
Zur Eigenwertaufgabe Ax = λBx
inferred← citeshttps://doi.org/10.1007/bf00778428openalex-snapshot
Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf02243830openalex-snapshot
Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
inferred← citeshttps://doi.org/10.1007/bfb0064904openalex-snapshot
Simultaneous rayleigh-quotient iteration methods for large sparse generalized eigenvalue problems
inferred← citeshttps://doi.org/10.1007/bfb0069380openalex-snapshot
Relaxation methods for the computation of the spectral norm
inferred← citeshttps://doi.org/10.1007/bfb0095354openalex-snapshot
A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices
inferred← citeshttps://doi.org/10.1007/s10444-026-10356-xopenalex-snapshot
On Rayleigh quotients and characteristic equations for symmetric matrices connected with coordinate updatings
inferred← citeshttps://doi.org/10.1016/0022-460x(80)90520-9openalex-snapshot
A numerical study of the solution of the partial eigenvalue problem
inferred← citeshttps://doi.org/10.1016/0045-7825(77)90011-1openalex-snapshot
Two algorithms for treating ax = λbx
inferred← citeshttps://doi.org/10.1016/0045-7825(87)90023-5openalex-snapshot
A partial preconditioned conjugate gradient method for large eigenproblems
inferred← citeshttps://doi.org/10.1016/0045-7949(81)90097-3openalex-snapshot
On the estimation of the optimum accelerator of SCOR for the eigenvalue problem
inferred← citeshttps://doi.org/10.1016/0045-7949(94)00424-2openalex-snapshot
Improving the convergence rate of the inverse iteration method
inferred← citeshttps://doi.org/10.1016/0097-8485(80)80001-5openalex-snapshot
The eigenvalue problem in configuration interaction calculations: A computer program based on a new derivation of the algorithm of Davidson
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/j.aml.2025.109765openalex-snapshot
On global convergence of admissibly randomized coordinate descent method
inferred← citeshttps://doi.org/10.1016/j.aml.2026.109940openalex-snapshot
On global convergence of steepest coordinate descent method
inferred← citeshttps://doi.org/10.1016/j.apnum.2025.04.010openalex-snapshot
On greedy randomized coordinate updating iteration methods for solving symmetric eigenvalue problems
inferred← citeshttps://doi.org/10.1016/j.apnum.2025.06.001openalex-snapshot
On steepest coordinate descent method for computing extreme eigenpairs of symmetric matrices
inferred← citeshttps://doi.org/10.1093/imanum/draf103openalex-snapshot
On greedy randomized coordinate descent methods for computing the extreme eigenpairs of symmetric matrices
inferred← citeshttps://doi.org/10.1093/imanum/draf157openalex-snapshot
Randomized admissible block coordinate descent methods for computing extreme eigenpairs of symmetric matrices
inferred← citeshttps://doi.org/10.1109/acssc.2003.1291863openalex-snapshot
A structured least-squares approach to blind channel identification and equalization
inferred← citeshttps://doi.org/10.1137/0719089openalex-snapshot
A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
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.