cern.jet.math
Class Polynomial

java.lang.Object
  |
  +--cern.jet.math.Constants
        |
        +--cern.jet.math.Polynomial

public class Polynomial

extends Constants

Polynomial functions.

Field Summary

Fields inherited from class cern.jet.math.Constants

big, biginv, LOGPI, MACHEP, MAXGAM, MAXLOG, MINLOG, SQRTH, SQTPI

Constructor Summary

protected

Polynomial() Makes this class non instantiable, but still let's others inherit from it.

Method Summary

static double	p1evl(double x, double[] coef, int N) Evaluates the given polynomial of degree N at x.
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 java.lang.ArithmeticException

Evaluates the given polynomial of degree N at x. Evaluates polynomial when coefficient of N is 1.0. Otherwise same as polevl().

                     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
 

The function p1evl() assumes that coef[N] = 1.0 and is omitted from the array. Its 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.

java.lang.ArithmeticException

polevl

public static double polevl(double x,
                            double[] coef,
                            int N)
                     throws java.lang.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.

java.lang.ArithmeticException