AERN-RnToRm-0.4.9.1: polynomial function enclosures (PFEs) approximating exact real functionsSource codeContentsIndex
Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Reduce
Portabilityportable
Stabilityexperimental
Maintainermik@konecny.aow.cz
Description

Internal module for Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.

Implementation of field arithmetic over polynomials with pointwise rounding uniform over the whole unit domain.

Synopsis
chplReduceTermCount :: (ERRealBase b, DomainBox box varid Int, Ord box) => Int -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b)
chplReduceDegree :: (ERRealBase b, DomainBox box varid Int, Ord box) => Int -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b)
Documentation
chplReduceTermCount :: (ERRealBase b, DomainBox box varid Int, Ord box) => Int -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b)Source
chplReduceDegreeSource
:: (ERRealBase b, DomainBox box varid Int, Ord box)
=> Intnew maximal order
-> ERChebPoly box b
-> (ERChebPoly box b, ERChebPoly box b)lower and upper bounds with limited degree
Convert a polynomial to a lower-order one that is dominated by (resp. dominates) it closely on the domain [-1,1].
Produced by Haddock version 2.4.2