On some topological properties of numerical algorithms

DOI10.1007/BF01932311zbMATH Open0246.65018OpenAlexW2079272786MaRDI QIDQ5659035FDOQ5659035

Martti Tienari

Publication date: 1972

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932311

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50)

Cites Work

• The outer and inner syntax of a programming language
• Flowchart machines
• A statistical model of roundoff error for varying length floating-point arithmetic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
• Towards accurate statistical estimation of rounding errors in floating-point computations
• A survey of techniques in applied computational complexity
• Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms
• An analysis of the effect of rounding errors on the flow of control in numerical processes
• Taylor expansion of the accumulated rounding error

This page was built for publication: On some topological properties of numerical algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659035)