polynomials-bernstein-1.1.2: A solver for systems of polynomial equations in bernstein form

Safe HaskellNone
LanguageHaskell98

Algebra.Polynomials.Numerical

Contents

Description

This module contains the definition of the main arithmetic tools used in Metafont'.

Synopsis

Raw operations

fromIntegral# :: Integral x => x -> (#Double, Double#) Source

Converts an Integral value into an interval.

plus :: Double -> Double -> Double -> Double -> (#Double, Double#) Source

Interval addition

minus :: Double -> Double -> Double -> Double -> (#Double, Double#) Source

Interval substraction

over :: Double -> Double -> Double -> Double -> (#Double, Double#) Source

Interval division

times :: Double -> Double -> Double -> Double -> (#Double, Double#) Source

Interval multiplication

cos# :: Double -> Double -> (#Double, Double#) Source

Interval cosine

sin# :: Double -> Double -> (#Double, Double#) Source

Interval sine

The Interval type

class Intervalize a where Source

Two common operations on types defined with intervals.

interval :: Double -> Interval Source

Converts an optimal IEEE-754 representation of a number into an optimal interval containing this number.

intersectsd :: Interval -> Interval -> Bool Source

Intersection of two Intervals.

union :: Interval -> Interval -> Interval Source

Union of two intersecting intervals (undefined behaviour if they do not intersect).