dsp-0.1: Haskell Digital Signal ProcessingContentsIndex
Numeric.Approximation.Chebyshev
Portabilityportable
Stabilityexperimental
Maintainerm.p.donadio@ieee.org
Description

Function approximation using Chebyshev polynomials

 f(x) = ( sum (k=0..N-1) c_k * T_k(x) ) - 0.5 * c_0 

over the interval [a,b]

Reference: NRiC

Synopsis
cheby_approx :: (Double -> Double) -> Double -> Double -> Int -> [Double]
cheby_eval :: [Double] -> Double -> Double -> Double -> Double
Documentation
cheby_approx
:: (Double -> Double)f(x)
-> Doublea
-> Doubleb
-> IntN
-> [Double]c_n
Calculates the Chebyshev approximation to f(x) over [a,b]
cheby_eval
:: [Double]c_n
-> Doublea
-> Doubleb
-> Doublex
-> Doublef(x)
Evaluates the Chebyshev approximation to f(x) over [a,b] at x
Produced by Haddock version 0.8