Uses of Interface
JSci.maths.polynomials.Polynomial

Packages that use Polynomial
JSci.maths.polynomials   
 

Uses of Polynomial in JSci.maths.polynomials
 

Classes in JSci.maths.polynomials that implement Polynomial
 class ComplexPolynomial
          A Polynomial over the complex field.
 class RealPolynomial
          A Polynomial as a Ring.Member over a real Field
 

Methods in JSci.maths.polynomials that return Polynomial
 Polynomial ComplexPolynomial.divide(Field.Member f)
          Returns the division of this polynomial by a scalar.
 Polynomial Polynomial.divide(Field.Member a)
          Return a new Polynomial with coefficients divided by a
 Polynomial RealPolynomial.divide(Field.Member f)
          return a new real Polynomial with coefficients divided by f
 Polynomial RealMonomialBasis.getBasisVector(int k)
           
 Polynomial RealLagrangeBasis.getBasisVector(int k)
          The basis vector as described above
 Polynomial PolynomialBasis.getBasisVector(int k)
          Get the kth basis vector
 Polynomial ComplexLagrangeBasis.getBasisVector(int k)
           
 Polynomial ComplexPolynomial.multiply(Field.Member f)
          Returns the multiplication of this polynomial by a scalar.
 Polynomial Polynomial.multiply(Field.Member a)
          Return a new Polynomial with coefficients multiplied by a
 Polynomial RealPolynomial.multiply(Field.Member f)
          Returns the multiplication of this polynomial by a scalar
 Polynomial RealMonomialBasis.superposition(Field.Member[] coeff)
           
 Polynomial RealLagrangeBasis.superposition(Field.Member[] coeff)
          Make a superposition of basis- vectors for a given set of coefficients.
 Polynomial PolynomialBasis.superposition(Field.Member[] coeff)
          Get a superposition of basis vectors
 Polynomial ComplexLagrangeBasis.superposition(Field.Member[] coeff)
           
 

Methods in JSci.maths.polynomials with parameters of type Polynomial
static ComplexSquareMatrix PolynomialMath.getFrobeniusMatrix(Polynomial p)
          Get the (complex) frobenius matrix for a given polynomial.
static Complex[] PolynomialMath.getNullPoints(Polynomial p)
          Calculate the null points of a given polynomial by solving the eigenvalue problem for the frobenius matrix This is not yet implemented (depends on a QR- decomposition)
static int PolynomialMath.maxDegree(Polynomial p1, Polynomial p2)
          Get the maximum degree of two polynomials
static int PolynomialMath.minDegree(Polynomial p1, Polynomial p2)
          Get the minimal degree of two polynomials
static ComplexPolynomial PolynomialMath.toComplex(Polynomial p)
          Try to cast a Polynomial to a complex polynomial