Given f=[f1,f2]^t and the jacobian matrix for it
How can i make a function using Newtons method that takes initial guess of x1,x2 with a tolerance of E and a max iterations of k to find the roots?
Given f=[f1,f2]^t and the jacobian matrix for it
How can i make a function using Newtons method that takes initial guess of x1,x2 with a tolerance of E and a max iterations of k to find the roots?
roots are places where f1 and f2 are both zeros. so you can use a cost function of the form f1^2 + f2^2
, and use fmincond/fminunc/fminsearch to find answers