next up previous contents
Next: Full continuation procedure Up: Implementation Previous: Certified Newton   Contents

Procedure for following branches

This procedure takes as input a set of $n$ solutions of the system and will return points on the $n$ branches. The branches will be followed until a given value for the parameter is reached or if Kantorovitch theorem is no more satisfied for some value of the parameter. It is implemented as:

 
int ALIAS_Start_Continuation(int m,int n,int NUM,
       INTERVAL_MATRIX &Solutions,
       INTERVAL_VECTOR (* IntervalFunction)(int,int,INTERVAL_VECTOR &), 
       INTERVAL_MATRIX (* Gradient)(int, int,INTERVAL_VECTOR &), 
       INTERVAL_MATRIX (* IntervalHessian)(int,int,INTERVAL_VECTOR &),
       double epsilon,double epsilonf,
       double *z,double delta,double mindelta,
       INTERVAL &Rangez,
       int sens,
       MATRIX &BRANCH,int *NBBRANCH)
the arguments being: The return code is: Even for a negative return code the points in BRANCH are valid: the procedure will return the points that have computed on the $n$ branches but is simply not able to determine the location of new branches that may have appeared.


next up previous contents
Next: Full continuation procedure Up: Implementation Previous: Certified Newton   Contents
Jean-Pierre Merlet 2012-12-20