Numeric.Polynomial

math-functions-0.2.1.0: Special functions and Chebyshev polynomials

Copyright | (c) 2012 Aleksey Khudyakov
License | BSD3
Maintainer | bos@serpentine.com
Stability | experimental
Portability | portable
Safe Haskell | None
Language | Haskell2010

Numeric.Polynomial

Contents

- Polynomials
  - Lists

Description

Function for evaluating polynomials using Horher's method.

Synopsis

- evaluatePolynomial :: (Vector v a, Num a) => a -> v a -> a
- evaluateEvenPolynomial :: (Vector v a, Num a) => a -> v a -> a
- evaluateOddPolynomial :: (Vector v a, Num a) => a -> v a -> a
- evaluatePolynomialL :: Num a => a -> [a] -> a
- evaluateEvenPolynomialL :: Num a => a -> [a] -> a
- evaluateOddPolynomialL :: Num a => a -> [a] -> a

# 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 #