biz.source_code.dsp.math

## Class PolynomialRootFinderLaguerre

• ```public class PolynomialRootFinderLaguerre
extends Object```
A root finder for polynomials with complex coefficients. It uses Laguerre's method to find the zeros of a polynomial.

This class is based on C source code by Anthony J. Fisher.

Reference: Wikipedia.

• ### Method Summary

All Methods
Modifier and Type Method and Description
`static Complex[]` `findRoots(Complex[] coeffs)`
Finds the zeros of a complex polynomial.
`static Complex[]` `findRoots(double[] coeffs)`
Finds the zeros of a real polynomial.
• ### Methods inherited from class java.lang.Object

`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`
• ### Method Detail

• #### findRoots

`public static Complex[] findRoots(double[] coeffs)`
Finds the zeros of a real polynomial. The coefficients are copied into a complex array and then the complex `findRoots()` is called.
Parameters:
`coeffs` - The polynomial coefficients in order of decreasing powers.
Returns:
The zeros of the polynomial.
• #### findRoots

`public static Complex[] findRoots(Complex[] coeffs)`
Finds the zeros of a complex polynomial.

The polynomial has the form: ` coeffs[0] * x^n + coeffs[1] * x^(n-1) + ... coeffs[n-1] * x + coeffs[n] `

Parameters:
`coeffs` - The polynomial coefficients in order of decreasing powers.
Returns:
The zeros of the polynomial.