The accurate solution of certain continuous problems using only single precision arithmetic

DOI10.1007/BF01936142zbMath0623.65030OpenAlexW1978916107MaRDI QIDQ1091751

B. George

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

convergencetruncation errorfloating point arithmeticiterative refinementcontinuous problemdiscretization problemfloating point subtractionGill-Møller algorithmrounding-errors

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Numerical quadrature and cubature formulas (65D32)

Related Items (2)

Parallel vectorized implementations of compensated summation algorithms ⋮ \(\mathbb{Q}\)-Fano threefolds of index 7

Cites Work

• Numerical stability of the Chebyshev method for the solution of large linear systems
• Iterative improvement without double precision in a boundary value problem
• Iterative refinement implies numerical stability
• Quasi double-precision in floating point addition
• Numerical Stability in Problems of Linear Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The accurate solution of certain continuous problems using only single precision arithmetic