In file No file:

int polyroot (const double* poly, int order, std::complex<double>* roots)

Finds the real and complex roots of a real polynominal

Documentation

Finds the real and complex roots of a real polynominal. Uses the Jenkins-Traub method and is based on the code found at http://www.crbond.com/roots.htm

The supplied polynomial must have a non-zero leading coefficient. The length of the roots array must be at least order. The number of specified coefficients must be order+1 with the coefficient of highest power starting first.

Returns:
Number of roots (-1 on error)
Parameters:
poly - Coefficients of polynomial in decreasing order
order - Order of polynomial
roots - Roots of the polynomial (return)
Author:
Written March 2003 by Daniel Sigg
Version:
1.0

alphabetic index hierarchy of classes


Please send questions and comments to zweizig_j@ligo.caltech.edu


generated by doc++