Automatic a priori round-off analysis. I: Arithmetic conditions

DOI10.1007/BF02242384zbMath0261.65037OpenAlexW2922918653MaRDI QIDQ2560704

Yanyan Li

Publication date: 1972

Published in: Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50)

Related Items (3)

Remarks on the complexity of roundoff analysis ⋮ On the stability of finite numerical procedures ⋮ On the stability of finite numerical procedures

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the instability of Gaussian elimination
• On the stability of finite numerical procedures

This page was built for publication: Automatic a priori round-off analysis. I: Arithmetic conditions