Interval package: Difference between revisions

104 bytes removed ,  17 February 2015
m
→‎What to expect: Updated benchmark after upgrading the linear solver
m (→‎Matrix operations: Updated notes in linear systems after an upgrade to the linear system solver)
m (→‎What to expect: Updated benchmark after upgrading the linear solver)
Line 51: Line 51:
All arithmetic interval operations are simulated in high-level octave language using C99 or multi-precision floating-point routines, which is a lot slower than a hardware implementation [https://books.google.de/books?id=JTc4XdXFnQIC&pg=PA61]. Building interval arithmetic operations from floating-point routines is easy for simple monotonic functions, e. g., addition and subtraction, but is complex for others, e. g., [http://exp.ln0.de/heimlich-power-2011.htm interval power function], atan2, or [[#Reverse_arithmetic_operations|reverse functions]]. For some interval operations it is not even possible to rely on floating-point routines, since not all required routines are available in C99 or BLAS.
All arithmetic interval operations are simulated in high-level octave language using C99 or multi-precision floating-point routines, which is a lot slower than a hardware implementation [https://books.google.de/books?id=JTc4XdXFnQIC&pg=PA61]. Building interval arithmetic operations from floating-point routines is easy for simple monotonic functions, e. g., addition and subtraction, but is complex for others, e. g., [http://exp.ln0.de/heimlich-power-2011.htm interval power function], atan2, or [[#Reverse_arithmetic_operations|reverse functions]]. For some interval operations it is not even possible to rely on floating-point routines, since not all required routines are available in C99 or BLAS.


Great algorithms and optimizations exist for floating-point matrix arithmetic in GNU Octave. Good interval versions of these still have to be found and implemented. For example, multiplication of matrices with many elements becomes unfeasible as it takes a lot of time. (For that purpose one could use the [[#Related work|INTLAB toolbox]], which uses a less accurate arithmetic)
For example, multiplication of matrices with many elements becomes unfeasible as it takes a lot of time.


{| class="wikitable" style="margin: auto; align:right"
{| class="wikitable" style="margin: auto; align:right"
Line 65: Line 65:
|align="right"| 0.002
|align="right"| 0.002
|align="right"| 0.1
|align="right"| 0.1
|align="right"| 1
|align="right"| 0.2
|-
|-
| 20
| 20
Line 71: Line 71:
|align="right"| 0.005
|align="right"| 0.005
|align="right"| 0.3
|align="right"| 0.3
|align="right"| 3
|align="right"| 0.5
|-
|-
| 30
| 30
Line 77: Line 77:
|align="right"| 0.007
|align="right"| 0.007
|align="right"| 0.6
|align="right"| 0.6
|align="right"| 7
|align="right"| 1.1
|-
|-
| 40
| 40
Line 83: Line 83:
|align="right"| 0.009
|align="right"| 0.009
|align="right"| 1.0
|align="right"| 1.0
|align="right"| 13
|align="right"| 1.9
|-
|-
| 50
| 50
Line 89: Line 89:
|align="right"| 0.013
|align="right"| 0.013
|align="right"| 1.6
|align="right"| 1.6
|align="right"| 21
|align="right"| 3.0
|}
|}


''Why is the interval package accurate?''
''Why is the interval package accurate?''
The GNU Octave built-in floating-point routines are not useful for interval arithmetic: Their results depend on hardware, system libraries and compilation options.  
The GNU Octave built-in floating-point routines are not useful for interval arithmetic: Their results depend on hardware, system libraries and compilation options.  
The interval package handles all arithmetic functions with the help of the [http://www.mpfr.org/ GNU MPFR library]. With MPFR it is possible to compute system-independent, valid and tight enclosures of the correct results.
The interval package handles all arithmetic functions with the help of the [http://www.mpfr.org/ GNU MPFR library]. With MPFR it is possible to compute system-independent, valid and tight enclosures of the correct results. However, it should be noted that some reverse operations and matrix operations do not exists in GNU MPFR and therefore cannot be computed with the same accuracy.


== Quick start introduction ==
== Quick start introduction ==
240

edits