Remarks on the complexity of roundoff analysis

DOI10.1007/BF02260371zbMath0276.65019MaRDI QIDQ1393806

D. Massart

Publication date: 1974

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Stability of fast algorithms for matrix multiplication ⋮ A survey of techniques in applied computational complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic a priori round-off analysis. I: Arithmetic conditions
• Statistical study of the rounding errors of some algebraic transformations
• Modern Error Analysis
• Automatic error analysis for determining precision
• Numerical Stability in Problems of Linear Algebra
• On the stability of finite numerical procedures