Verified Solution of Nonlinear Systems

  • R. Baker Kearfott
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 13)


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.


Unique Root Code List Relative Diameter Uniqueness Verification Floating Point Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1996

Authors and Affiliations

  • R. Baker Kearfott
    • 1
  1. 1.University of Southwestern LouisianaUSA

Personalised recommendations