# Questions tagged [newton-method]

Method for finding successively better approximations to the roots (or zeroes) of a real-valued function

25 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
0answers
180 views

0answers
304 views

1answer
137 views

### Which SciPy nonlinear solver when Jacobian is analytically known and sparse?

I have a nonlinear function fun with n inputs and n outputs. I also have a function jac which calculates the Jacobian, which is ...
0answers
248 views

### Vectorised root finding in Python

I have an array of size (254, 80) which I am trying to use Scipy's fsolve on. I have found that the speed of using fsolve on a vector is quicker than it is in a for loop but only for vectors upto ...
0answers
222 views

### Newton - Raphson method : maxima of function in 2 variables

I am computing the maximum of a function (with two-variables) using Newton-Raphson method. The function is : $e^{-(x \ - x_0)^2 - (y \ - y_0)^2}$, whose maxima exists at $(x_0,y_0)$. The Jacobian ...
0answers
73 views

### Successive iteration method for solving eigenvalue ploblem

I have a question concerning the branch of successive iteration methods (Newton, Runge-Kutta). I definitely know (or can read in Wikipedia) the implementation of these methods. But I was wondering ...
0answers
105 views

0answers
67 views

### Mapping to a computationally less expensive basis when employing Newton's method

I'm looking for advice, or references, for a change of basis to my dependent variables that leads to a less computationally expensive scheme when solving a system of coupled polynomial equations. ...
0answers
84 views