Verified Solution of Nonlinear Systems
Recall that a main goal of this book is solution of Problem 1.2, that is, finding all solutions of an equation F(X)=0, F:ℝ n→ℝ n) within a box X ∈Iℝ n. In previous chapters, techniques useful in parts of the solution of this problem have been explained. Here, tessellation processes appear that combine these pieces into an overall algorithm. The output to this overall algorithm will be a list ℜ of small boxes that have been verified to contain unique roots and a list U of small boxes that have neither been verified to contain roots nor verified to not contain roots1.
KeywordsUnique Root Code List Relative Diameter Uniqueness Verification Floating Point Computation
Unable to display preview. Download preview PDF.