Pages that link to "Item:Q5607518"
From MaRDI portal
The following pages link to Pitfalls in Computation, or why a Math Book isn't Enough (Q5607518):
Displaying 15 items.
- Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model (Q316618) (← links)
- Interval probabilities and enclosures (Q382434) (← links)
- Fast interval matrix multiplication (Q451807) (← links)
- The functions erf and erfc computed with arbitrary precision and explicit error bounds (Q714627) (← links)
- The accuracy of least squares calculations with the Cholesky algorithm (Q911243) (← links)
- A robust forward-displacement analysis of spherical parallel robots (Q1048916) (← links)
- Algorithms for polynomials in Bernstein form (Q1105314) (← links)
- On the presumed superiority of analytical solutions over numerical methods (Q1705362) (← links)
- An alternative quadratic formula (Q1985483) (← links)
- A unified input-output analysis of four-bar linkages (Q2477751) (← links)
- Classroom examples of robustness problems in geometric computations (Q2479475) (← links)
- An algorithmic approach to linear systems (Q3339172) (← links)
- Efficient computation of the distribution functions of student's<i>t</i>chi-squared and<i>f</i>to moderate accuracy (Q3936155) (← links)
- Rounding errors in numerical solutions of two linear equations in two unknowns (Q4742223) (← links)
- How do you compute the midpoint of an interval? (Q5498687) (← links)
