|
Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Ring | Portability | portable | Stability | experimental | Maintainer | mik@konecny.aow.cz |
|
|
|
Description |
Internal module for Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.
Implementation of addition and multiplication over polynomials
with pointwise rounding uniform over the whole unit domain.
|
|
Synopsis |
|
chplAddConst :: (ERRealBase b, DomainBox box varid Int, Ord box) => b -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b, b) | | chplAdd :: (ERRealBase b, DomainBox box varid Int, Ord box) => ERChebPoly box b -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b, b) | | chplMultiply :: (ERRealBase b, DomainBox box varid Int, Ord box) => ERChebPoly box b -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b, b) | | chplScale :: (ERRealBase b, DomainBox box varid Int, Ord box) => b -> ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b, b) | | chplSquare :: (ERRealBase b, DomainBox box varid Int, Ord box) => ERChebPoly box b -> (ERChebPoly box b, ERChebPoly box b) |
|
|
Documentation |
|
|
:: (ERRealBase b, DomainBox box varid Int, Ord box) | | => b | | -> ERChebPoly box b | | -> (ERChebPoly box b, ERChebPoly box b, b) | lower and upper bounds on the sum and an upper bound on their difference
| Negate a polynomial exactly.
Add a constant to a polynomial, rounding downwards and upwards.
|
|
|
|
|
|
|
|
|
|
|
|
|
Multiply a polynomial by itself, rounding downwards and upwards.
|
|
Produced by Haddock version 2.4.2 |