math-functions-0.2.1.0: Special functions and Chebyshev polynomials

Copyright(c) 2012 Aleksey Khudyakov
LicenseBSD3
Maintainerbos@serpentine.com
Stabilityexperimental
Portabilityportable
Safe HaskellNone
LanguageHaskell2010

Numeric.Polynomial

Contents

Description

Function for evaluating polynomials using Horher's method.

Synopsis

Polynomials

evaluatePolynomial #

Arguments

:: (Vector v a, Num a) 
=> a

x

-> v a

Coefficients

-> a 

Evaluate polynomial using Horner's method. Coefficients starts from lowest. In pseudocode:

evaluateOddPolynomial x [1,2,3] = 1 + 2*x + 3*x^2

evaluateEvenPolynomial #

Arguments

:: (Vector v a, Num a) 
=> a

x

-> v a

Coefficients

-> a 

Evaluate polynomial with only even powers using Horner's method. Coefficients starts from lowest. In pseudocode:

evaluateOddPolynomial x [1,2,3] = 1 + 2*x^2 + 3*x^4

evaluateOddPolynomial #

Arguments

:: (Vector v a, Num a) 
=> a

x

-> v a

Coefficients

-> a 

Evaluate polynomial with only odd powers using Horner's method. Coefficients starts from lowest. In pseudocode:

evaluateOddPolynomial x [1,2,3] = 1*x + 2*x^3 + 3*x^5

Lists

evaluatePolynomialL :: Num a => a -> [a] -> a #

evaluateEvenPolynomialL :: Num a => a -> [a] -> a #

evaluateOddPolynomialL :: Num a => a -> [a] -> a #