On the public citation graph
Hierarchical relaxation
0 signed · 21 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/bf02252378openalex-snapshot
On the multi-grid method applied to difference equations
inferredcites →https://doi.org/10.1016/0021-9991(75)90072-8openalex-snapshot
On multiple grid and related techniques for solving discrete elliptic systems
inferredcites →https://doi.org/10.1016/0041-5553(64)90253-8openalex-snapshot
The speed of convergence of one iterative process
inferredcites →https://doi.org/10.1016/0041-5553(66)90118-2openalex-snapshot
On the convergence of a relaxation method with natural constraints on the elliptic operator
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0423762-1openalex-snapshot
Corrigendum: “Properties of the Taylor series expansion coefficients of the Jacobian elliptic functions” (Math. Comp. 30 (1976), no. 133, 143–147)
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0431719-xopenalex-snapshot
Multi-Level Adaptive Solutions to Boundary-Value Problems
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0488722-3openalex-snapshot
On the 𝑙² convergence of an algorithm for solving finite element equations
inferredcites →https://doi.org/10.1145/322063.322067openalex-snapshot
Asynchronous Iterative Methods for Multiprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118659199.ch8openalex-snapshot
Relaxation for Energy Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4684-6357-6_8openalex-snapshot
Ensemble Architectures and their Algorithms: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-69023-5_3openalex-snapshot
Elemente paralleler Algorithmen
inferred← citeshttps://doi.org/10.1007/978-94-009-7760-0_27openalex-snapshot
Parallel Non-Linear Algorithms
inferred← citeshttps://doi.org/10.1016/0010-4655(82)90126-6openalex-snapshot
Parallel non-linear algorithms
inferred← citeshttps://doi.org/10.1016/0024-3795(82)90242-7openalex-snapshot
Acceleration by aggregation of successive approximation methods
inferred← citeshttps://doi.org/10.1109/9.24227openalex-snapshot
Adaptive aggregation methods for infinite horizon dynamic programming
inferred← citeshttps://doi.org/10.1137/1.9781611971705.ch3openalex-snapshot
3. A Bibliography on Parallel and Vector Numerical Algorithms
inferred← citeshttps://doi.org/10.1137/1027055openalex-snapshot
Solution of Partial Differential Equations on Vector and Parallel Computers
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.