AERN-RnToRm 0.3.0.2 → 0.3.0.3
raw patch · 2 files changed
+27/−65 lines, 2 filesdep ~AERN-Real
Dependency ranges changed: AERN-Real
Files
- AERN-RnToRm.cabal +24/−65
- ChangeLog +3/−0
AERN-RnToRm.cabal view
@@ -1,5 +1,5 @@ Name: AERN-RnToRm-Version: 0.3.0.2+Version: 0.3.0.3 Cabal-Version: >= 1.2 Build-Type: Simple License: BSD3@@ -12,68 +12,27 @@ Synopsis: polynomial function enclosures (PFEs) approximating exact real functions Tested-with: GHC ==6.8.2 Description:- AERN-RnToRm provides- datatypes and abstractions for approximating functions- of type @D -> R^m@ where @D@ is a bounded interval in @R^n@- with non-empty interior.- .- Abstractions are provided via 4 type classes:- .- * ERUnitFnBase: - generalises polynomials with floating point coefficients.- .- * ERFnApprox:- generalises functions enclosures on a certain unspecified domain.- .- * ERUnitFnApprox (extends ERFnApprox): generalises function graph enclosures- on the domain @[-1,1]^n@.- .- * ERFnDomApprox (extends ERFnApprox):- generalises function enclosures over a specified and queriable domain box- (an instance of class DomainBox).- .- At all levels, all field operations are supported as well as- some elementary operations, namely exp, sin and cos.- Log and sqrt are planned to be added soon.- - End users are expected to work only with implementations of ERFnDomApprox.- .- Implementations of ERUnitFnBase:- .- * ERChebPoly - .- By using the Chebyshev basis on domain @[-1,1]^n@, - we gain simple and optimally rounding degree reduction - as well as relatively simple handling of rounding - in other operations.- .- Implementations of ERUnitFnApprox:- . - * ERFnInterval- .- Implementations of ERFnDomApprox:- .- * ERFnDomTranslApprox: - builds a basic implementation - using an instance of ERUnitFnApprox.- .- * ERFnTuple: - extends another implementation of ERFnDomApprox - to work with lists of functions simultaneously.- .- * ERFnDomEdgesApprox: - separately enclose a function on its domain box - as well as on all the domain's hyper-edges - (including the corners) using- another implementation of ERFnDomApprox.- .- * ERFnPiecewise: - allows the domain box to be bisected - to an arbitrary finite depth - and uses another implementation of ERFnDomApprox - to approximate the function on each segment. - .- Simple examples of usage can be found in /tests/: Demo.hs.+ AERN-RnToRm provides+ datatypes and abstractions for approximating functions+ of type @D -> R^m@ where @D@ is a bounded interval in @R^n@+ with non-empty interior.+ .+ The main datatype are function enclosures whose boundaries are+ piece-wise polynomial with a bounded degree. (This degree can+ be set arbitrarily high or as low as 0.)+ This datatype is supported by safely rounding operations+ whose precision can be increased arbitrarily, so that they+ all converge to the exact operations.+ Field operations, integration, maximisation and some elementary operations + (namely exp, sin, cos) are among those already implemented.+ .+ For an architectural overview, see module "Data.Number.ER.RnToRm".+ .+ A mathematical description of the very basics as well as a brief comparison+ with Taylor Models is included in the+ paper <http://www-users.aston.ac.uk/~konecnym/papers/cfv08.html>.+ .+ Simple examples of usage can be found in module @Demo.hs@ in folder @tests@. Extra-source-files: ChangeLog tests/Demo.hs @@ -84,10 +43,10 @@ hs-source-dirs: src if flag(containers-in-base) Build-Depends:- base < 3, binary >= 0.4, AERN-Real == 0.9.6+ base < 3, binary >= 0.4, AERN-Real >= 0.9.6 else Build-Depends:- base >= 3, containers, binary >= 0.4, AERN-Real == 0.9.6+ base >= 3, containers, binary >= 0.4, AERN-Real >= 0.9.6 Exposed-modules: Data.Number.ER.RnToRm, Data.Number.ER.RnToRm.BisectionTree.Path,
ChangeLog view
@@ -1,3 +1,6 @@+0.3.0.3: 7 August 2008+ * revamped package description to make it much shorter and linked it+ to the main module 0.3.0.2: 7 August 2008 * deleted irrelevant/confusing text from package description 0.3.0.1: 7 August 2008