cern.jet.math

## Class Polynomial

• ```public class Polynomial
extends Constants```
Polynomial functions.

• ### Fields inherited from class cern.jet.math.Constants

`big, biginv, LOGPI, MACHEP, MAXGAM, MAXLOG, MINLOG, SQRTH, SQTPI`
• ### Constructor Summary

Constructors
Modifier Constructor and Description
`protected ` `Polynomial()`
Makes this class non instantiable, but still let's others inherit from it.
• ### Method Summary

Methods
Modifier and Type Method and Description
`static double` ```p1evl(double x, double[] coef, int N)```
Evaluates the given polynomial of degree N at x, assuming coefficient of N is 1.0.
`static double` ```polevl(double x, double[] coef, int N)```
Evaluates the given polynomial of degree N at x.
• ### Methods inherited from class java.lang.Object

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

• #### Polynomial

`protected Polynomial()`
Makes this class non instantiable, but still let's others inherit from it.
• ### Method Detail

• #### p1evl

```public static double p1evl(double x,
double[] coef,
int N)
throws ArithmeticException```
Evaluates the given polynomial of degree N at x, assuming coefficient of N is 1.0. Otherwise same as polevl().
```                     2          N
y  =  C  + C x + C x  +...+ C x
0    1     2          N

where C  = 1 and hence is omitted from the array.
N

Coefficients are stored in reverse order:

coef[0] = C  , ..., coef[N-1] = C  .
N-1                   0

Calling arguments are otherwise the same as polevl().
```
In the interest of speed, there are no checks for out of bounds arithmetic.
Parameters:
`x` - argument to the polynomial.
`coef` - the coefficients of the polynomial.
`N` - the degree of the polynomial.
Throws:
`ArithmeticException`
• #### polevl

```public static double polevl(double x,
double[] coef,
int N)
throws ArithmeticException```
Evaluates the given polynomial of degree N at x.
```                     2          N
y  =  C  + C x + C x  +...+ C x
0    1     2          N

Coefficients are stored in reverse order:

coef[0] = C  , ..., coef[N] = C  .
N                   0
```
In the interest of speed, there are no checks for out of bounds arithmetic.
Parameters:
`x` - argument to the polynomial.
`coef` - the coefficients of the polynomial.
`N` - the degree of the polynomial.
Throws:
`ArithmeticException`