AERN-RnToRm-0.3.0.1: polynomial function enclosures (PFEs) approximating exact real functions

Portabilityportable
Stabilityexperimental
Maintainermik@konecny.aow.cz

Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Field

Description

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

Implementation of field arithmetic over polynomials with rounding consistent over the whole domain.

Synopsis

Documentation

chplAffine :: (ERRealBase b, DomainBox box varid Int, Ord box) => b -> Map varid b -> ERChebPoly box bSource

chplReduceDegreeSource

Arguments

:: (ERRealBase b, DomainBox box varid Int, Ord box) 
=> Int

new 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].

chplScale :: (ERRealBase b, DomainBox box varid Int, Ord box) => b -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b)Source

multiply a polynomial by a scalar rounding downwards and upwards

chplScaleApprox :: (ERRealBase b, DomainBox box varid Int, Ord box) => (b, b) -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b)Source

multiply a polynomial by a scalar interval rounding downwards and upwards