On the public citation graph

A faster SSOR algorythm

https://doi.org/10.1007/bf01399600
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-05156-2openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1090/s0025-5718-1955-0074929-1openalex-snapshot
On the numerical solution of elliptic difference equations
inferredcites →https://doi.org/10.2307/2002066openalex-snapshot
On the Numerical Solution of Elliptic Difference Equations
inferredcites →https://doi.org/10.2307/2003862openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.2307/2003967openalex-snapshot
An Introduction to Numerical Linear Algebra
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.1002/nav.3800280406openalex-snapshot
Computing the discounted return in markov and semi‐markov chains
inferred← citeshttps://doi.org/10.1002/nme.1620201209openalex-snapshot
Solution of the partial eigenproblem by iterative methods
inferred← citeshttps://doi.org/10.1007/bf01397654openalex-snapshot
Alternating methods for sets of linear equations
inferred← citeshttps://doi.org/10.1007/bf02237991openalex-snapshot
Alternating sequential-parallel calculation of eigenvalues for symmetric matrices
inferred← citeshttps://doi.org/10.1016/0168-9274(85)90027-3openalex-snapshot
Experiments in numerical methods for a problem in combustion modeling
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90061-qopenalex-snapshot
Serial and parallel value iteration algorithms for discounted Markov decision processes
inferred← citeshttps://doi.org/10.1080/00207169308804168openalex-snapshot
A systolic design for the A.O.R. and S.A.O.R. iterative methods for solving linear systems
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163366openalex-snapshot
Alternating sequential-parallel versions of FFT
inferred← citeshttps://doi.org/10.1109/tie.1982.356664openalex-snapshot
A Tri-State Oriented Parallel Processing System
inferred← citeshttps://doi.org/10.1109/tpas.1981.316851openalex-snapshot
Alternating Sequential/Parallel Processing Fundamental and Examples
inferred← citeshttps://doi.org/10.1137/0716014openalex-snapshot
On Different Splittings and the Associated Iteration Methods
inferred← citeshttps://doi.org/10.1137/0909060openalex-snapshot
Efficient Implementations of Certain Iterative Methods
inferred← citeshttps://doi.org/10.1137/0911051openalex-snapshot
Efficient Polynomial Preconditioning for the Conjugate Gradient Method
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.