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

Safe HaskellNone

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

data Interval Source

The interval type (most of its operations are calls to the raw functions)

Constructors

Interval 

Fields

ilow :: Double
 
iup :: Double
 

class Intervalize a whereSource

Two common operations on types defined with intervals.

interval :: Double -> IntervalSource

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

intersectsd :: Interval -> Interval -> BoolSource

Intersection of two Intervals.

union :: Interval -> Interval -> IntervalSource

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