On some topological properties of numerical algorithms
From MaRDI portal
Publication:5659035
DOI10.1007/BF01932311zbMath0246.65018OpenAlexW2079272786MaRDI QIDQ5659035
Publication date: 1972
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932311
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Roundoff error (65G50)
Related Items
Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions ⋮ Towards accurate statistical estimation of rounding errors in floating-point computations ⋮ Taylor expansion of the accumulated rounding error ⋮ A survey of techniques in applied computational complexity ⋮ An analysis of the effect of rounding errors on the flow of control in numerical processes ⋮ Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms
Cites Work