Newton's method, several variables

Please specify the dimension n of your problem:
n = Important: 1 <= n <= 50!

Please type the code for the evaluation of all components of F in the following textarea. Remember the correct line formatting: first 6 columns blank or 5 blanks and an alphanumeric character in column 6 (for a continuation line) or a numeric label in columns 1 to 5 with blank in column 6! Evaluation instructions in columns 7 to 72. Use the visible area only.
Important: function components are f(1),...,f(n). Input variables are n and x, output is ifail (is initialized) and f.
Variable names to be used are x(j), j=1,...,n.
You can make use of local variables x1h,....,x9h, a vector y with 50 components, the constants pi , e1(=exp(1)) and sqrt2(=sqrt(2)).
You also can use the integers i,j,k (for example for loops) and the logicals bool1,bool2,bool3. An instruction ifail=1 tells the solver that the current value x cannot be used. (for example if x(4) < 0 but you need log(x(4)) ). In this case the code tries to circumvent the situation by diminishing the stepsize t. You are not allowed to define any variables yourself. You must restrict your code according JAKEF's rules.

Please type your initial guess xstart = x(1),...,x(n) here:
A list of n numbers, separated by blank or comma.
xstart =

Please specify the desired final precision eps in x:
eps= Important: eps > 0 ! Internally eps is projected to
[1.0e-10,1.0e-2]

Please specify the maximum number of steps maxstep:
maxstep= Important: 1 <= maxstep <= 1000 !

Amount of error report
Choice of: 0, 1 ,2, or 3.
0=none
3=very detailed		 i1=

Amount of intermediate output
Choice of: 0, 1 ,2, or 3.
0=none
3=very detailed 		i2=

Amount of final output
No final output
Ouput of initial and final value of x
Iteration protocol

Click on "evaluate", in order to submit your input.

Back to the theory page

 Back to the top!

23.05.2016