Pitfalls in Computation, or why a Math Book isn't Enough
From MaRDI portal
Publication:5607518
DOI10.2307/2318109zbMath0207.15401OpenAlexW4249433618WikidataQ56813805 ScholiaQ56813805MaRDI QIDQ5607518
Publication date: 1970
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2318109
Related Items (15)
Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model ⋮ Algorithms for polynomials in Bernstein form ⋮ Interval probabilities and enclosures ⋮ On the presumed superiority of analytical solutions over numerical methods ⋮ The accuracy of least squares calculations with the Cholesky algorithm ⋮ Fast interval matrix multiplication ⋮ An alternative quadratic formula ⋮ A unified input-output analysis of four-bar linkages ⋮ Classroom examples of robustness problems in geometric computations ⋮ An algorithmic approach to linear systems ⋮ The functions erf and erfc computed with arbitrary precision and explicit error bounds ⋮ How do you compute the midpoint of an interval? ⋮ Rounding errors in numerical solutions of two linear equations in two unknowns ⋮ A robust forward-displacement analysis of spherical parallel robots ⋮ Efficient computation of the distribution functions of student'stchi-squared andfto moderate accuracy
This page was built for publication: Pitfalls in Computation, or why a Math Book isn't Enough
