Finds multiple roots of polynomials using Weierstrass' method
npm install durand-kernerdurand-kerner
=============
Finds all the roots of a polynomial by Weierstrass' method (or known in Abramowitz&Stegun as the Durand-Kerner method). This is basically a generalization of Newton's method that works for multiple roots.
To find the roots for 1 + 1x - 1x^2:
``javascript
var findRoots = require("durand-kerner")
var roots = findRoots([1, 1, -1])
// Now:
// roots[0] = real part of roots
// roots[1] = imaginary part of roots
for(var i=0; i
}
`
1.618033988749895+0i
-0.6180339887498949+0i
Install
Install using npm: npm install durand-kerner
API
####
Finds the roots of a polynomial whose real coefficients are given by and imaginary coefficients by i_coeff.*
r_coeff - the real part of the polynomial's coefficients, stored in an array
* i_coeff - the imaginary part of the polynomial's coefficients (default all 0)
n_iters - Maximum number of iterations to run before bailout. Default is 100 n * n
* - Stopping threshold. Default is 1e-6
* - Initial guess for solution vector (must have the same length as r_coeff`). This also gets the solution (optional)Returns An array of roots.