vec_math
Class Chebyshev

java.lang.Object
  vec_math.RecursivePolynom
      vec_math.Chebyshev

All Implemented Interfaces:

Function

public class Chebyshev
extends RecursivePolynom

The recursive formular for the Legendre polynomials. Start the recursion with i=0.

Nested Class Summary

Nested classes/interfaces inherited from class vec_math.RecursivePolynom

RecursivePolynom.Constant, RecursivePolynom.Linear

Constructor Summary

Chebyshev(double[] c, double min, double max)
The coefficients of the legendre polynom must at least suffice for a linear relation.

Method Summary

protected double

recursion(int o, double norm, double xm1, double xm2) The recursion for the Chebyshev polynomials is

Methods inherited from class vec_math.RecursivePolynom

evaluate, getCoefficient, getOrder, normalize, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

Chebyshev

public Chebyshev(double[] c,
                 double min,
                 double max)

The coefficients of the legendre polynom must at least suffice for a linear relation. The min and max define the range of allowed parameter space.

Method Detail

recursion

protected double recursion(int o,
                           double norm,
                           double xm1,
                           double xm2)

The recursion for the Chebyshev polynomials is

       x_i = 2*norm*x_i-1-x_i-2
       

Specified by:

recursion in class RecursivePolynom