Next: 4.1 Introduction
Up: Shape Interrogation for Computer
Previous: 3.6 Euler's theorem and
Contents
Index
4. Nonlinear Polynomial Solvers and Robustness Issues
Subsections
- 4.1 Introduction
- 4.2 Local solution methods
- 4.3 Classification of global solution methods
- 4.3.1 Algebraic and Hybrid Techniques
- 4.3.2 Homotopy (Continuation) Methods
- 4.3.3 Subdivision Methods
- 4.4 Projected Polyhedron algorithm
- 4.5 Auxiliary variable method for nonlinear systems
with square roots of polynomials
- 4.6 Robustness issues
- 4.7 Interval arithmetic
- 4.8 Rounded interval arithmetic and its implementation
- 4.8.1 Double precision floating point arithmetic
- 4.8.2 Extracting the exponent from the binary representation
- 4.8.3 Comparison of two different unit-in-the-last-place
implementations
- 4.8.4 Hardware rounding for rounded interval arithmetic
- 4.8.5 Implementation of rounded interval arithmetic
- 4.9 Interval Projected Polyhedron algorithm
- 4.9.1 Formulation of the governing polynomial equations
- 4.9.2 Comparison of software and hardware rounding
December 2009