Searching for Solutions of Finite Nonlinear Systems: An Interval Approach |
Common terms and phrases
Algorithm 3.1 analysis applied approach arithmetic operation assume beginning bisection rules bounds CALL Chapter choose COMMON computational COND construct contains contains no solution convergence coordinate direction DATE defined definition determine equations evaluation exact example excluded exists fixed point FORMAT function further given go to Step guaranteed half-region holds implements integer interval arithmetic interval extensions interval number interval vector iterative Lemma matrix midpoint Moore n-cube nature Newton-step Newton's method nonsingular obtained partition possible present PRINT problem produce Proof properties region selection require result RETURN routine rules safe starting region SAFESTART algorithm satisfies selection sequence solution of f(x solved stack Step stop subroutine sufficient conditions suitable initial approximation suppose symmetric techniques TEMP terminate TEST Theorem tion University values verifiable zero of f