On the public citation graph

Sequential defect correction for high-accuracy floating-point algorithms

https://doi.org/10.1007/bfb0099525
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/bf01432879openalex-snapshot
The defect correction principle and discretization methods
inferredcites →https://doi.org/10.1007/bf01932286openalex-snapshot
Iterated defect correction for the efficient solution of stiff systems of ordinary differential equations
inferredcites →https://doi.org/10.1007/bf02237993openalex-snapshot
E-methods for fixed point equations f(x)=x
inferredcites →https://doi.org/10.1007/bf02241697openalex-snapshot
Solving nonlinear systems with least significant bit accuracy
inferredcites →https://doi.org/10.1007/bf02253892openalex-snapshot
Least significant bit evaluation of arithmetic expressions in single-precision
inferredcites →https://doi.org/10.1016/b978-0-12-428650-4.50009-9openalex-snapshot
INTERVAL ARITHMETIC
inferredcites →https://doi.org/10.1016/c2013-0-11018-5openalex-snapshot
Computer Arithmetic in Theory and Practice
inferredcites →https://doi.org/10.15480/882.305openalex-snapshot
Solving nonlinear systems with least significant bit accuracy

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-9092-3_4openalex-snapshot
Floating-Point Systems for Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_5openalex-snapshot
C-XSC and Closely Related Software Packages
inferred← citeshttps://doi.org/10.1007/978-3-7091-0525-2_1openalex-snapshot
Fast and Accurate Vector Operations
inferred← citeshttps://doi.org/10.1007/978-3-7091-6280-4_18openalex-snapshot
Geometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th Order ODEs
inferred← citeshttps://doi.org/10.1007/978-3-7091-6957-5_1openalex-snapshot
Automatic Result Verification
inferred← citeshttps://doi.org/10.1007/978-3-7091-6957-5_13openalex-snapshot
Precise Evaluation of Polynomials in Several Variables
inferred← citeshttps://doi.org/10.1007/bf02243806openalex-snapshot
A self-validating numerical method for the matrix exponential
inferred← citeshttps://doi.org/10.1007/bf02247884openalex-snapshot
Simultaneous self-verified computation of exp (A) and ∫ 0 1 exp (As) dsexp (As) ds
inferred← citeshttps://doi.org/10.1007/bf02260501openalex-snapshot
Accurate arithmetic results for decimal data on non-decimal computers
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90319-0openalex-snapshot
Precise evaluation of a polynomial at a point given in staggered correction format
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)62850-7openalex-snapshot
Interval Arithmetic in Staggered Correction Format
inferred← citeshttps://doi.org/10.1137/25m1722573openalex-snapshot
Verified Error Bounds for Sparse Systems Part I: The Splitting of a Matrix into Two Factors
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.