On the public citation graph

Numerical stability of descent methods for solving linear equations

https://doi.org/10.1007/bf01390179
0 signed · 18 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-1-4757-5592-3openalex-snapshot
Introduction to Numerical Analysis
inferredcites →https://doi.org/10.1007/bf01394452openalex-snapshot
Numerical stability of the Chebyshev method for the solution of large linear systems
inferredcites →https://doi.org/10.1007/bf01411845openalex-snapshot
Round-off error analysis of iterations for large linear systems
inferredcites →https://doi.org/10.2307/2007454openalex-snapshot
Introduction to Numerical Analysis.
inferredcites →https://doi.org/10.4064/-13-1-589-606openalex-snapshot
Round-off error analysis of the gradient method
inferredcites →https://doi.org/10.6100/ir133301openalex-snapshot
Round-off error analysis of descent methods for solving linear equations

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-1-4613-8351-2_3openalex-snapshot
Componentwise Error Analysis for Stationary Iterative Methods
inferred← citeshttps://doi.org/10.1007/bf00053375openalex-snapshot
Analysis of error propagation in the ABS class for linear systems
inferred← citeshttps://doi.org/10.1007/s40096-017-0236-yopenalex-snapshot
General solution of full row rank linear systems of equations using a new compression ABS model
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90393-bopenalex-snapshot
On the real convergence rate of the conjugate gradient method
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00300-4openalex-snapshot
Why does information-based complexity use the real number model?
inferred← citeshttps://doi.org/10.1017/s096249290626001xopenalex-snapshot
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
inferred← citeshttps://doi.org/10.1137/s0895479895284944openalex-snapshot
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
inferred← citeshttps://doi.org/10.1137/s0895479897331862openalex-snapshot
Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
inferred← citeshttps://doi.org/10.25911/5d7a2ce02b007openalex-snapshot
Graphical Models: Modeling, Optimization, and Hilbert Space Embedding
inferred← citeshttps://doi.org/10.4236/am.2010.13025openalex-snapshot
On the Behavior of the Residual in Conjugate Gradient Method
inferred← citeshttps://doi.org/10.48550/arxiv.0909.1334openalex-snapshot
Lower Bounds for BMRM and Faster Rates for Training SVMs
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.