next up previous contents
Next: Roots simplification procedures Up: Filtering simplification procedures Previous: The SimplexConsistency procedure   Contents

The IntervalNewton procedure

This procedure allows one to take into account the specific structure of the system to solve when using the interval Newton method. In this method the classical algorithm, for example used by default in GradientSolve or HessianSolve, computes numerically for a box $X$ the interval evaluation of $M=J^{-1}(X_m)J(X)$ where $X_m$ is the mid-point of $X$. This numerical calculation does not allow to to take into account the dependency between the elements of $J$ when computing $M$. This procedure compute symbolically the matrix $M$ and re-arrange its elements (with MinimalCout) in order to reduce the dependency problem.

The syntax of this procedure is

IntervalNewton(func,nfunc,funcproc,njfunc,Jfuncproc,typemid,grad,grad3B,incl,vars,procname)
where


next up previous contents
Next: Roots simplification procedures Up: Filtering simplification procedures Previous: The SimplexConsistency procedure   Contents
Jean-Pierre Merlet 2012-12-20