Changes

Jump to navigation Jump to search
14,505 bytes removed ,  04:15, 10 June 2019
m
Remove redundant Category:Packages.
The GNU Octave interval package for real-valued [httphttps://octaveen.sourceforgewikipedia.netorg/intervalwiki/ Interval_arithmetic interval packagearithmetic] provides data types and fundamental operations for .* Intervals are closed, connected subsets of the real valued interval arithmetic based on the common floating-point format “binary64” a. k. a. double-precisionnumbers. It aims to Intervals may be standard compliant with the unbound (upcomingin either or both directions) [http://standardsor empty.ieee.orgIn special cases <code>+inf</developcode> and <code>-inf</project/1788code> are used to denote boundaries of unbound intervals, but any member of the interval is a finite real number.html IEEE 1788] and therefore implements the * Classical functions are extended to interval functions as follows: The result of function f evaluated on interval x is an interval '''enclosure of all possible values'set-based'' of f over x where the function is defined. Most interval arithmetic flavorfunctions in this package manage to produce a very accurate such enclosure. '''Interval * The result of an interval arithmetic''' produces mathematically proven numerical resultsfunction is an interval in general. It might happen, that the mathematical range of a function consist of several intervals, but their union will be returned, e. g., 1 / [-1, 1] = [Entire].
__TOC__[[File:Interval-sombrero.png|280px|thumb|left|Example: Plotting the interval enclosure of a function]]<div style== Motivation =="clear:left"></div>
{{quote|Give a digital computer a problem in arithmetic, and it will grind away methodically, tirelessly, == Distribution ==* [https://octave.sourceforge.io/interval/ Latest version at gigahertz speedOctave Forge]** <code>pkg install -forge interval</code>** [https://octave.sourceforge.io/interval/overview.html function reference]** [https://octave.sourceforge.io/interval/package_doc/index.html package documentation] (user manual)'''Third-party'''* [https://tracker.debian.org/pkg/octave-interval Debian GNU/Linux], until ultimately it produces the wrong answer[https://launchpad. … An net/ubuntu/+source/octave-interval computation yields a pair of numbers, an upper and a lower bound, which are guaranteed to enclose the exact answerLaunchpad Ubuntu]* [https://aur. Maybe you still don’t know the truth, but at least you know how much you don’t knowarchlinux.|Brian Hayes|org/packages/octave-interval/ archlinux user repository]* Included in [httphttps://dxftp.doignu.org/10gnu/octave/windows/ official Windows installer] and installed automatically with Octave (since version 4.0.15111)* [https:/2003/github.6com/macports/macports-ports/tree/master/math/octave-interval/ MacPorts] for Mac OS X* [https://www.freshports.484 DOIorg/math/octave-forge-interval/ FreshPorts] for FreeBSD* [https: 10//cygwin.1511com/cgi-bin2/2003package-grep.6cgi?grep=octave-interval Cygwin] for Windows* [https://build.484opensuse.org/package/show/science/octave-forge-interval openSUSE build service]}}
{| class="wikitable" style="margin: auto"Development status ==!Standard floating point arithmetic* Completeness!Interval ** All required functions from [https://standards.ieee.org/findstds/standard/1788-2015.html IEEE Std 1788-2015], IEEE standard for interval arithmetic|, are implemented. The standard was approved by IEEE-SA on June 11, 2015. It will remain active for ten years. The standard was approved by ANSI in 2016.| style = "vertical-align: top" | <span style="opacity** Also, the minimalistic standard [https://standards.ieee.5">octave:1> <org/findstds/standard/span>19 * 01788.1 - 2 + 02017.html IEEE Std 1788.1-2017], IEEE standard for interval arithmetic (simplified) is fully implemented. The standard was approved by IEEE-SA on December 6, 2017 (and published in January 2018).** In addition there are functions for interval matrix arithmetic, N-dimensional interval arrays, plotting, and solvers.* Quality ans = 1** Most arithmetic operations produce tight, correctly-rounded results.3878eThat is, the smallest possible interval with double-16precision (binary64) endpoints, which encloses the exact result.| style = "vertical-align** Includes [https: top" |//github.com/oheim/ITF1788 large test suite] for arithmetic functions <span style="opacity** For open bugs please refer to the [https://savannah.gnu.5">octave:1> <org/search/span>x ?words=forge+interval&type_of_search= infsup ("0bugs&only_group_id=1925&exact=1 bug tracker].1"); <span style="opacity* Performance** All elementary functions have been [https://octave.5">octave:2> <org/doc/interpreter/span>19 * x Vectorization-and-Faster-Code- 2 + xExecution.html vectorized] and run fast on large input data. ans ⊂ ** Arithmetic is performed with the [-3http://www.mpfr.org/ GNU MPFR] library internally.1918911957973251e-16Where possible, +1the optimized [http://web.archive.org/web/20170128033523/http://lipforge.3877787807814457eens-16lyon.fr/www/crlibm/ CRlibm]library is used.* Portability|}** Runs in GNU Octave ≥ 3.8.2** Known to run under GNU/Linux, Microsoft Windows, macOS, and FreeBSD
Floating== Project ideas (TODOs) ==* To be considered in the future: Algorithms can be migrated from the C-point arithmetic, as specified by XSC Toolbox (C++ code) from [http://enwww2.math.wikipediauni-wuppertal.orgde/wikiwrswt/IEEE_floating_point IEEE 754xsc/cxsc_new.html](nlinsys.cpp and cpzero.cpp), is available in almost every computer system todayhowever these would need gradient arithmetic and complex arithmetic.* Interval version of <code>interp1</code>* Extend <code>subsasgn</code> to allow direct manipulation of inf and sup (and dec) properties. >> A = infsup ("[2, 4]"); >> A.inf = infsup ("[1, 3]") A = [1, 4] >> A. It is wide-spreadinf = 5 A = [Empty]:* While at it, implemented also allow multiple subscripts in common hardware and integral part in programming languages<code>subsasgn</code> >> A(:)(2:4)(2) = 42; # equivalent to A(3) = 42 >> A.inf(3) = 42; # also A(3).inf = 42 >> A.inf.inf = 42 # should produce error? >> A.inf.sup = 42 # should produce error?* Tight Enclosure of Matrix Multiplication with Level 3 BLAS [http://kam.mff.cuni.cz/conferences/swim2015/abstracts/ozaki.pdf] [http://kam.mff.cuni.cz/conferences/swim2015/slides/ozaki.pdf]* Verified Convex Hull for Inexact Data [http://kam.mff.cuni.cz/conferences/swim2015/abstracts/ohta.pdf] [http://kam.mff.cuni.cz/conferences/swim2015/slides/ohta. For example, the doublepdf]* Implement user-precision format is controllable output from the default numeric data type in GNU Octaveinterval standard (e. g. Benefits are obviousvia printf functions): The results a) It should be possible to specify the preferred overall field width (the length of arithmetic operations s). b) It should be possible to specify how Empty, Entire and NaI are welloutput, e.g., whether lower or upper case, and whether Entire becomes [Entire] or [-defined Inf, Inf]. c) For l and comparable between different systems u, it should be possible to specify the field width, and computation the number of digits after the point or the number of significant digits. (partly this is highly efficientalready implemented by output_precision (...) / `format long` / `format short`) d) It should be possible to output the bounds of an interval without punctuation, e.g., 1.234 2.345 instead of [1.234, 2.345]. For instance, this might be a convenient way to write intervals to a file for use by another application.
However, there are some downsides of floating-point arithmetic in practice, which will eventually produce errors in computations.== Compatibility ==* Floating-point arithmetic The interval package's main goal is often used mindlessly by developers. [http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html] [http://www.cs.berkeley.edu/~wkahan/Mindless.pdf] [http://www.ima.umn.edu/~arnold/disasters/]* The binary data types categorically are not suitable for doing financial computations. Very often representational errors are introduced when using “real world” decimal numbers. [http://en.wikipedia.org/wiki/Decimal_computer]* Even if the developer would to be proficient, most developing environments / technologies limit floating-point arithmetic capabilities to a very limited subset of compliant with IEEE 754: Only one or two data types, no rounding modes, missing functions … [http://www.cs.berkeley.edu/~wkahan/JAVAhurt.pdf]* Results are hardly predictable. [https://hal.archivesStd 1788-ouvertes.fr/hal-00128124/en/] All operations produce the best possible accuracy ''at runtime''2015, this so it is how a floating point works. Contrariwise, financial computer systems typically use a [http://en.wikipedia.org/wiki/Fixed-point_arithmetic fixedcompatible with other standard-point arithmetic] conforming implementations (COBOL, PL/I, …), where overflow and rounding can be precisely predicted ''at compile-time''.* Results are system dependent. All but on the most basic floating-point set of operations are not guaranteed to be accurate and produce different results depending on low level libraries and hardware. [http://www.gnu.org/software/libc/manual/html_node/Errors-in-Math-Functions.html#Errors-in-Math-Functions] [http://developer.amd.com/tools-and-sdks/cpu-development/libm/]* If you do not know described by the technical details (cf. first bulletstandard document) you ignore the fact that the computer lies to you in many situations. For exampleOther implementations, when looking at numerical output and the computer says “<code>ans = 0.1</code>,” this is not absolutely correct. In fact, the value is only ''close enough'' which are known to the value 0.1. Additionally, many functions produce limit values (∞ × −∞ = −∞, ∞ ÷ 0 = ∞, ∞ ÷ −0 = −∞, log (0) = −∞), which is sometimes (but not always!) useful when overflow and underflow occur.aim for standard conformance are:
Interval arithmetic addresses above problems in its very special way and introduces new possibilities for algorithms* [https://github.com/JuliaIntervals/IntervalArithmetic. For example, the jl IntervalArithmetic.jl package] (Julia)* [httphttps://engithub.wikipediacom/jinterval/jinterval JInterval library] (Java)* [https://github.orgcom/wikinadezhin/Interval_arithmetic#Interval_Newton_method interval newton methodlibieeep1788 ieeep1788 library] is able to find ''all'' zeros of a particular function.(C++) created by Marco Nehmeier, later forked by Dmitry Nadezhin
== Theory =Octave Forge simp package ===In 2008/2009 there was a Single Interval Mathematics Package (SIMP) for Octave, which has eventually become unmaintained at Octave Forge.
=== Online Introductions ===The simp package contains a few basic interval arithmetic operations on scalar or vector intervals. It does not consider inaccurate built-in arithmetic functions, round-off, conversion and representational errors. As a result its syntax is very easy, but the arithmetic fails to produce guaranteed enclosures.
It is recommended to use the interval package as a replacement for simp. However, function names and interval constructors are not compatible between the packages. === INTLAB ===This interval package is ''not'' meant to be a replacement for INTLAB and any compatibility with it is pure coincidence. Since both are compatible with GNU Octave, they happen to agree on many function names and programs written for INTLAB may possibly run with this interval package as well. Some fundamental differences that I am currently aware of:* INTLAB is non-free software, it grants none of the [http://www.mathsgnu.manchester.ac.uk/~highamorg/narepphilosophy/narep416free-sw.pdf Interval analysis in MATLABhtml four essential freedoms] Note: The of free software* INTLAB toolbox for Matlab is not entirely compatible conforming to IEEE Std 1788-2015 and the parsing of intervals from strings uses a different format—especially for the uncertain form* INTLAB supports intervals with this complex numbers and sparse interval package matrices, but no empty intervals* INTLAB uses inferior accuracy for GNU Octavemost arithmetic operations, cf. [[#Compatibility]]. However, basic because it focuses on speed* Basic operations can be compared and should be compatible for common intervals.found in both packages, but the availability of special functions depends
=== Moore's fundamental theroem of interval arithmetic ===
Let '''''y''''' = ''f''('''''x''''') be the result of
interval-evaluation of ''f'' over a box '''''x''''' = (''x''<sub>1</sub>, … , ''x''<sub>''n''</sub>)
using any interval versions of its component library functions. Then
# In all cases, '''''y''''' contains the range of ''f'' over '''''x''''', that is, the set of ''f''('''''x''''') at points of '''''x''''' where it is defined: '''''y''''' ⊇ Rge(''f'' | '''''x''''') = {''f''(''x'') | ''x'' ∈ '''''x''''' ∩ Dom(''f'') }
# If also each library operation in ''f'' is everywhere defined on its inputs, while evaluating '''''y''''', then ''f'' is everywhere defined on '''''x''''', that is Dom(''f'') ⊇ '''''x'''''.
# If in addition, each library operation in ''f'' is everywhere continuous on its inputs, while evaluating '''''y''''', then ''f'' is everywhere continuous on '''''x'''''.
# If some library operation in ''f'' is nowhere defined on its inputs, while evaluating '''''y''''', then ''f'' is nowhere defined on '''''x''''', that is Dom(''f'') ∩ '''''x''''' = Ø.
<div style="display:flex; align-items: flex-start"><div style= What to expect =="margin-right: 2em">The interval arithmetic provided by {{Code|Computation with this interval package is '''slow'''|<syntaxhighlight lang="octave">pkg load intervalA1 = infsup (2, 3);B1 = hull (-4, A2);C1 = midrad (0, but '''accurate'''.2);
''Why is the interval package slow?''A1 + B1 * C1All 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:</syntaxhighlight>}}</books.google.de/books?iddiv><div>{{Code|Computation with INTLAB|<syntaxhighlight lang=JTc4XdXFnQIC&pg"octave">startintlabA2 =PA61]. Building interval arithmetic operations from floating-point routines is easy for simple monotonic functionsinfsup (2, e. g., addition and subtraction, but is complex for others, e. g., [http://exp.ln0.de/heimlich-power3);B2 = hull (-2011.htm interval power function]4, atan2, or [[#Reverse_arithmetic_operations|reverse functions]]. For some interval operations it is not even possible to rely on floating-point routinesA2);C2 = midrad (0, since not all required routines are available in C99 or BLAS.2);
For example, multiplication of matrices with many elements becomes unfeasible as it takes a lot of time.A2 + B2 * C2</syntaxhighlight>}}</div></div>
{| class="wikitable" style="margin: auto; align:right"|+ Approximate runtime (wall clock time in seconds) <span style="font-weight: normal">— Results have been produced with GNU Octave 3.8.2 and Interval package 0.1.4 on an Intel® Core™ i5-4340M CPU (2.9–3.6 GHz)</span>!rowspan="2"|Interval matrix size!valignKnown differences ="top" style="min-width:6em"|<code>plus</code>!valign="top" style="min-width:6em"|<code>times</code>!valign="top" style="min-width:6em"|<code>log</code>Simple programs written for INTLAB should run without modification with this interval package. The following table lists common functions that use a different name in INTLAB.!valign="top" style="min-width:6em"{|<code>pow</code>!valign="top" style="min-width:6em"|<code>mtimes</code>interval package!valign="top" style="min-width:6em"|<code>mtimes</code>!valign="top" style="min-width:6em"|<code>inv</code>INTLAB
|-
!style="font-weight:normal"|tightest<br/>accuracyinfsup (x)!style="font-weight:normal"|tightest<br/>accuracy!style="font-weight:normal"|tightest<br/>accuracy!style="font-weight:normal"|tightest<br/>accuracy!style="font-weight:normal"|valid<br/>accuracy!style="font-weight:normal"|tightest<br/>accuracy!style="font-weight:normal"|valid<br/>accuracyintval (x)
|-
| 10 × 10wid (x)|align="right"| < 0.001|align="right"| < 0.001|align="right"| 0.001|align="right"| 0.008|align="right"| 0.001|align="right"| 0.002|align="right"| 0.025diam (x)
|-
| 100 × 100subset (a, b)|align="right"| 0.003|align="right"| 0.010|align="right"| 0.055|align="right"| 0.61|align="right"| 0.012|align="right"| 0.53|align="right"| 0.30in (a, b)
|-
| 500 × 500interior (a, b)|align="right"| 0.060|align="right"| 0.24|align="right"| 1.3|align="right"| 15|align="right"| 0.30|align="right"| 63|align="right"| 4.2in0 (a, b)
|-
| isempty (x)
| isnan (x)
|-
| disjoint (a, b)
| emptyintersect (a, b)
|-
| hdist (a, b)
| qdist (a, b)
|-
| disp (x)
| disp2str (x)
|-
| infsup (s)
| str2intval (s)
|-
| isa (x, "infsup")
| isintval (x)
|}
''Why is the interval package accurate?''== Developer Information ===== Source Code Repository ===The GNU Octave built-in floating-point routines are not useful for interval arithmetichttps: Their results depend on hardware, system libraries and compilation options//sourceforge. The net/p/octave/interval package handles all arithmetic functions with the help of the [http:/ci/default/www.mpfr.orgtree/ GNU MPFR library]. With MPFR it is possible to compute system-independent, valid and tight enclosures of the correct results for most functions. 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.
== Installation = Dependencies ===The interval package is available at Octave Forge [http://octave.sourceforge.net/interval/] and can be installed from within GNU Octave (version ≥ 3.8.2). During installation parts of the package are compiled for the target system, which requires the GNU MPFR development libraries (version ≥ 3.1.0) to be installed. <span style="opacity:.5">octave:1> </span>pkg apt-get install liboctave-forge interval <span style="opacity:.5">octave:2> </span>pkg load intervaldev mercurial make automake libmpfr-dev
=== Build ===The ''development version'' may be obtained from its mercurial repository. For convenience contains a Makefile target allows running which controls the package from sourcebuild process.Some common targets are: hg clone http:* <code>make release<//hgcode> Create a release tarball and the HTML documentation for [[Octave Forge]] (takes a while).* <code.sf.net>make check</p/octave/interval octavecode> Run the full test-intervalsuite to verify that code changes didn't break anything (takes a while). cd octave-interval; * <code>make run</code> Quickly start Octave with minimal recompilation and functions loaded from the workspace (for interactive testing of code changes).
== Quick start introduction =='''Build dependencies'''<code>apt-get install libmpfr-dev autoconf automake inkscape zopfli</code>
=== Input and output Architecture ===Before exercising interval arithmetic, interval objects must be created from non-interval data. There are interval constants <code>empty</code> and <code>entire</code> and the interval constructors <code>infsupdec</code> (create an interval from boundaries), <code>midrad</code> (create an interval from midpoint and radius) and <code>hull</code> (create an interval enclosure for a list of mixed arguments: numbers, intervals or interval literals). The constructors are very sophisticated and can be used with several kinds of parameters: Interval boundaries can be given by numeric values or string values with decimal numbers.
{{Code|Create In a nutshell the package provides two new data types to users: bare intervals for performing interval arithmetic|and decorated intervals. The data types are implemented as:* class <code>infsup<syntaxhighlight lang="octave"/code>infsupdec (1bare interval) # [1]_cominfsupdec with attributes <code>inf</code> (1, 2lower interval boundary) # [1, 2]_cominfsupdec and <code>sup</code> ("3", "4"upper interval boundary) # [3, 4]_com* class <code>infsupdec </code> ("1.1"decorated interval) # [1.0999999999999998, 1.1000000000000001]_cominfsupdec which extends the former and adds attribute <code>dec</code> ("5.8e-17") # [5.799999999999999e-17, 5.800000000000001e-17]_commidrad (12, 3interval decoration) # [9, 15]_commidrad ("4.2", "1e-7") # [4.199999899999999, 4.2000001000000005]_comhull (3, 42, "19.3", "-2.3") # [-2.3000000000000003, +42]_trvhull ("pi", "e") # [2.718281828459045, 3.1415926535897936]_trv</syntaxhighlight>}}
The default text representation Almost all functions in the package are implemented as methods of intervals is not guaranteed to be exactthese classes, because this would massively spam console outpute. g. For example, the exact text representation of <code>realmin@infsup/sin</code> would be over 700 decimal places long! Howeverimplements the sine function for bare intervals. Most code is kept in m-files. Arithmetic operations that require correctly-rounded results are implemented in oct-files (C++ code), these are used internally by the m-files of the default text representation package. The source code is correct organized as it guarantees to contain the actual boundaries.follows:
{{Warning +- doc/ – package manual +- inst/ |Decimal fractions as well as numbers of high magnitude +- @infsup/ | | +- infsup.m – class constructor for bare intervals | | +- sin.m – sine function for bare intervals (> 2<sup>53<uses mpfr_function_d internally) | | `- ... – further functions on bare intervals | +- @infsupdec/sup> | | +- infsupdec.m – class constructor for decorated intervals | | +- sin.m – sine function for decorated intervals (uses @infsup/sin internally) should always be passed as | | `- ... – further functions on decorated intervals | `- ... – a string to the constructorfew global functions that don't operate on intervals `- src/ +- mpfr_function_d. Otherwise it is possible, that GNU Octave introduces conversion errors when the numeric literal is converted into floatingcc – computes various arithmetic functions correctly rounded (using MPFR) `-point format '''before''' it is passed to the constructor.}}.. – other oct-file sources
{{Code|Beware of the conversion pitfall|=== Best practices ======= Parameter checking ====* All methods must check <code>nargin</code> and call <code>print_usage<syntaxhighlight lang="octave"/code>## The numeric constant “0.2” is an approximation of if the## decimal number 0of parameters is wrong.2This prevents simple errors by the user. An * Methods with more than 1 parameter must convert non-interval around this approximation## will not contain parameters to intervals using the decimal number 0.2.infsupdec (0.2) # [.20000000000000001, class constructor.20000000000000002]_com## However, passing This allows the decimal number 0.2 as a string## user to mix non-interval parameters with interval parameters and the interval constructor function treats any inputs as intervals. Invalid values will create an interval which## actually encloses be handled by the decimal numberclass constructors.infsupdec if (not (isa (x, "0.2infsup") # [.19999999999999998)) x = infsup (x); endif if (not (isa (y, .20000000000000002]_com"infsup")))</syntaxhighlight> y = infsup (y);}} endif
if (not (isa (x, "infsupdec"))) x =infsupdec (x); endif if (not (isa (y, "infsupdec"))) y === Interval vectors and matrices ====infsupdec (y);Vectors and matrices of intervals can be created by passing numerical matrices, char vectors or cell arrays to the interval constructors. With cell arrays it is also possible to mix several types of boundaries. endif
Interval matrices behave like normal matrices in GNU ==== Use of Octave and functions ====Octave functions may be used as long as they don't introduce arithmetic errors. For example, the ceil function can be used for broadcasting and vectorized safely since it is exact on binary64 numbers. function evaluationx = ceil (x) ... parameter checking ... x.inf = ceil (x.inf); x.sup = ceil (x.sup); endfunction
{{Code|Create interval matrices|If Octave functions would introduce arithmetic/rounding errors, there are interfaces to MPFR (<code>mpfr_function_d<syntaxhighlight lang="octave"/code>M = infsup (magic (3)) # [8] [1] [6] # [3] [5] [7] # [4] [9] [2]infsup and crlibm (magic (3), magic (3) + 1) # [8, 9] [1, 2] [6, 7] # [3, 4] [5, 6] [7, 8] # [4, 5] [9, 10] [2, 3]infsupdec (["0.1"; "0.2"; "0.3"; "0.4"; "0.5"]) # [.09999999999999999, .10000000000000001]_com # [.19999999999999998, .20000000000000002]_com # [.29999999999999998, .30000000000000005]_com # [.39999999999999996, .40000000000000003]_com # [.5]_cominfsup ({1, eps; "4<code>crlibm_function</7", "pi"}, {2, 1; "e", "0xff"}code>) # [1, 2] [2.220446049250313e-16, 1] # [which can produce guaranteed boundaries.5714285714285713, 2.7182818284590456] [3.1415926535897931, 255]</syntaxhighlight>}}
=== Arithmetic operations = Vectorization & Indexing ====The interval packages comprises many interval arithmetic operationsAll functions should be implemented using vectorization and indexing. This is very important for performance on large data. For example, consider the plus function. It computes lower and upper boundaries of the result (x. A complete list can inf, y.inf, x.sup, y.sup may be found in its [http://octavevectors or matrices) and then uses an indexing expression to adjust values where empty intervals would have produces problematic values. function x = plus (x, y) .sourceforge.net/interval/overview.html function reference]parameter checking ... l = mpfr_function_d ('plus', -inf, x.inf, y.inf); u = mpfr_function_d ('plus', +inf, x. Function names match GNU Octave standard functions where applicable and follow recommendations by IEEE 1788 otherwisesup, cfy. [[#IEEE_1788_indexsup); emptyresult = isempty (x) |IEEE 1788 index]].isempty (y); l(emptyresult) = inf; u(emptyresult) = -inf; endfunction
Arithmetic functions in a set-based interval arithmetic follow these rules== VERSOFT ==The [http: Intervals are sets//uivtx.cs. They are subsets of the set of real numberscas. The interval version of an elementary function such as sincz/~rohn/matlab/ VERSOFT] software package (by Jiří Rohn) has been released under a free software license (''x''Expat license) is essentially the natural extension to sets of the corresponding point-wise function on real numbers. That is, the function is evaluated for each number in and algorithms may be migrated into the interval where the function is defined and the result must be an enclosure of all possible values that may occurpackage.
By default arithmetic functions are computed with best possible accuracy {|! Function! Status! Information|-|colspan="3"|Real (which is more than what is guaranteed by GNU Octave core functionsor complex). The result will therefore be a tight and very accurate enclosure of the true mathematical value in most cases. Details on each function's accuracy can be found in its documentation, which is accessible with GNU Octave's help command.data only: Matrices|-|verbasis{{Code|Examples of using interval arithmetic functionsstyle="color:red"| trapped|depends on <syntaxhighlight langcode style="octavecolor:red">verfullcolrank</code>sin (infsupdec (0.5)) # [.47942553860420294, .47942553860420301]_com|-pow (infsupdec (2), infsupdec (3, 4)) # [8, 16]_com|vercondnumatan2 (infsupdec (1), infsupdec (1))|style="color:red"| trapped # [.7853981633974482, .7853981633974484]_com| depends on <code style="color:red">versingval</code>midrad (magic (3), 0.5) * pascal (3)|- # [13.5, 16.5]_com [25, 31]_com [42, 52]_com|verdet # [13.5, 16.5]_com [31, 37]_com [55, 65]_com # [13.5, 16.5]_com [25, 31]_com [38, 48]_com|style="color:red"| trapped| depends on <code>vereig</syntaxhighlightcode>}}|-|verdistsing|style=== Numerical operations ==="color:red"| trappedSome operations | depends on intervals do not return an interval enclosure, but a single number (in double-precision). Most important are <codestyle="color:red">infversingval</code> and |-|verfullcolrank|style="color:red"| trapped| depends on <code>supverpinv</code>, which return the lower and upper interval boundaries.|-|vernorm2|style="color:red"| trappedMore such operations are | depends on <codestyle="color:red">midversingval</code> |-|vernull (approximation of the interval's midpointexperimental), | unknown| depends on <codestyle="color:red">widverlsq</code> (approximation of the interval's width), ; todo: compare with local function inside <codestyle="color:green">radverintlinineqs</code> (approximation of the interval's radius), |-|verorth|style="color:red"| trapped| depends on <codestyle="color:red">magverbasis</code> (interval's magnitude) and <codestyle="color:red">migverthinsvd</code> (interval's mignitude).|-|verorthproj|style="color:red"| trapped| depends on <code style="color:red">verpinv</code> and <code style= Boolean operations =="color:red">verfullcolrank</code>|-|verpd|style="color:red"| trappedInterval comparison operations produce boolean results. While some comparisons are especially for intervals | depends on <code>isspd</code> (subsetby Rump, interior, ismember, isempty, disjoint, …to be checked) others are extensions of simple numerical comparison. For example, the less-or-equal comparison is mathematically defined as ∀and <subcode style="color:red">''a''vereig</subcode> ∃|-|verpinv|style="color:red"| trapped| dependency <subcode>''b''verifylss</subcode> ''a'' ≤ ''b'' ∧ ∀is implemented as <subcode>''b''mldivide</subcode> ∃; depends on <subcode style="color:red">''a''verthinsvd</subcode> ''a'' ≤ ''b''.|-|verpmat|style="color:red"| trapped | depends on <span code style="opacitycolor:.5red">octave:1> verregsing</spancode>infsup (1, 3) <= infsup (2, 4) ans = 1|-|verrank|style="color:red"| trapped| depends on <code style="color:red">versingval</code> and <code style= Matrix operations ===Above mentioned operations can also be applied element-wise to interval vectors and matrices. Many operations use [http"color:red">verbasis<//www.gnu.org/software/octave/doc/interpreter/Vectorizationcode>|-and-Faster-Code-Execution.html#Vectorization-and-Faster-Code-Execution vectorization techniques].|verrrefIn addition, there are matrix operations |style="color:red"| trapped| depends on interval matrices. These operations comprise<code style="color: dot product, matrix multiplication, vector sums (all with tightest accuracy), matrix inversion, matrix powers, and solving linear systems (the latter are less accurate). As a result of missing hardware red">verfullcolrank</ low-level library support code> and missing optimizations, these operations are relatively slow compared to familiar operations in floating-point arithmetic. {{Code|Examples of using interval matrix functions|<syntaxhighlight langcode style="octavecolor:red">verpinv</code>A |-|colspan= infsup ([1, 2, "3; 4, 0, 0; 0, 0, 1]); A "|Real (2, 3or complex) data only: Matrices: Eigenvalues and singular values|-|vereig|style= "[0, 6]color:red"| trapped # [1] [2] [3]| depends on proprietary <code>verifyeig</code> function from INTLAB, depends on complex interval arithmetic # [4] [0] [0, 6]|- # [0] [0] [1]|<s>vereigback</s>B |style= inv "color:green"| free, migrated (Afor real eigenvalues) # [0] [.25] [-1.5, 0]| dependency <code>norm</code> is already implemented # [.5] [-.125] [|-1.5, -.75] # [0] [0] [1]|verspectradA * B|style="color:red"| trapped # [1] [0] [-1.5, +1.5]| main part implemented in <code>vereig</code> # [0] [1] [|-6, +6] # [0] [0] [1] A |colspan= infsup "3"|Real (magic (3)or complex)data only: Matrices: Decompositions # [8] [1] [6]|- # [3] [5] [7]|verpoldec # [4] [9] [2]|style="color:red"| trappedc | depends on <code style= A \ [3; 4; 5]"color:red">verthinsvd</code> # [.18333333333333326, .18333333333333349]|- # [.43333333333333329, .43333333333333341]|verrankdec # [.18333333333333315, .18333333333333338]|style="color:red"| trappedA * c| depends on <code style="color:red">verfullcolrank</code> and <code style="color:red">verpinv</code> # [2.9999999999999982, 3.0000000000000018]|- # [3.9999999999999982, 4.0000000000000018]|verspectdec # [4.9999999999999982, 5.0000000000000018]|style="color:red"| trapped| main part implemented in <code>vereig</syntaxhighlightcode>}}|-|verthinsvd|style==== Notes on linear systems ===="color:red"| trappedA system of linear equations | implemented in the form A''x'' <code>vereig</code>|-|colspan= b with intervals can be seen as a range of ''classical'' linear systems, which can be solved simultaneously. Whereas classical algorithms compute an approximation for a single solution of a single linear system, interval algorithms compute an enclosure for all possible solutions of "3"|Real (possibly severalor complex) linear systems. Some characteristics should definitely be known when linear interval systems are solveddata only: Matrix functions|-|vermatfun|style="color:red"| trapped* If the linear system is underdetermined and has infinitely many solutions, the interval solution will be unbound | main part implemented in at least one of its coordinates. Contrariwise, from an unbound result it can not be concluded whether the linear system is underdetermined or has solutions.<code>vereig</code>* If the interval result is empty in at least one of its coordinates, the linear system is guaranteed to be underdetermined and has no solutions. Contrariwise, from a non|-empty result it can not be concluded whether all or some of the |colspan="3"|Real data only: Linear systems have solutions or not.(rectangular) * Wide intervals within the matrix A can easily lead to a superposition of cases, where the rank of A is no longer unique. If the linear interval system contains cases of linear independent equations as well as linear dependent equations, the resulting enclosure of solutions will inevitably be very broad.|-|<s>verlinineqnn</s>However|style="color:green"| free, solving linear systems with interval arithmetic can produce useful results in many cases and automatically carries migrated| use <code>glpk</code> as a guaranty replacement for error boundaries. Additionally, it can give better information than the floating<code>linprog</code>|-point variants for some cases.|verlinsys|style="color:red"| trapped{{Code|Standard floating point arithmetic versus interval arithmetic dependency <code>verifylss</code> is implemented as <code>mldivide</code>; depends on ill-conditioned linear systems|<syntaxhighlight langcode style="octavecolor:red">A verpinv</code>, <code style= [1, 0; 2, 0];## This linear system has no solutionsA \ [3; 0] # warning"color: matrix singular to machine precisionred">verfullcolrank</code>, rcond and <code style= 0"color:red">verbasis</code> # 0.60000|- # 0.00000|verlsq## This linear system has many solutions|style="color:red"| trappedA \ [4; 8]| depends on <code style="color:red">verpinv</code> and <code style="color:red">verfullcolrank</code> # 4|- # 0 ## The empty interval vector proves that there is no solutioninfsup (A) \ [|colspan="3; 0]"|Real data only: Optimization # [Empty]|- # [Empty]|verlcpall## The unbound interval vector indicates that there may be many solutions|style="color:green"| freeinfsup (A) \ [4; 8]| depends on <code>verabsvaleqnall</code> # [4] # [Entire]|-|<s>verlinprog</syntaxhighlights>}}|style="color:green"| free, migrated| use <code>glpk</code> as a replacement for <code>linprog</code>; dependency <code>verifylss</code> is implemented as <code>mldivide</code>== Advanced topics ==|-|verlinprogg|style=== Error handling ==="color:red"| trapped| depends on <code>verfullcolrank</code>Due to the nature of set|-based interval arithmetic, one should not observe errors (in the sense of raised GNU Octave error messages) during computation unless operations are evaluated for incompatible data types. Arithmetic operations which are not defined for (parts of) their input, simply ignore anything that is outside of their domain.|verquadprog| unknownHowever, | use <code>quadprog</code> from the interval constructors can produce errors depending on the input. The optim package; use <code>glpk</code> as a replacement for <code>infsuplinprog</code> constructor will fail if the interval boundaries are invalid. Contrariwise, the (preferred) ; dependency <code>infsupdecverifylss</code>, is implemented as <code>midradmldivide</code> and ; depends on <code>hullisspd</code> constructors will only issue a warning and return a (by Rump, to be checked, algorithm in [NaI] object, which will propagate and survive through computationshttp://www.ti3.tuhh. NaI stands for “not an interval”de/paper/rump/Ru06c.pdf]) {{Code|Effects of set-based interval arithmetic on partial functions and the NaI object|<syntaxhighlight langcolspan="octave3">|Real (or complex) data only: Polynomials## Evaluation of a function outside of its domain returns an empty interval|-infsupdec (2) / 0 # [Empty]_trv|verrootsinfsupdec (0) ^ infsupdec (0) # [Empty]_trv|style="color:red"| trapped| main part implemented in <code>vereig</code>## Illegal interval construction creates a NaI|-infsupdec |colspan="3"|Interval (3, 2or real) # [NaI]data: Matrices## NaI even survives through computations|-ans + 1 # [NaI]|verhurwstab</syntaxhighlight>|style="color:red"| trapped}} There are some situations where the interval package cannot decide whether an error occurred or not and issues a warning. The user may choose to ignore these warnings or handle them as errors, see | depends on <codestyle="color:red">help warningverposdef</code> for instructions.|-|verinverse{| classstyle="wikitablecolor:green" | free| depends on <code style="margincolor: autogreen">verintervalhull</code>, to be migrated!Warning ID|-!Reason|<s>verinvnonneg</s>!Possible consequences|style="color:green"| free, migrated
|-
| interval:PossiblyUndefinedverposdef|style="vertical-aligncolor:topred" | Interval construction with boundaries in decimal formattrapped| depends on <code>isspd</code> (by Rump, to be checked) and the constructor can't decide whether the lower boundary is smaller than the upper boundary. Both boundaries are very close and lie between subsequent binary64 numbers.|<code style="vertical-aligncolor:topred" | The constructed interval is a valid and tight enclosure of both numbers. If the lower boundary was actually greater than the upper boundary, this illegal interval is not considered an error.>verregsing</code>
|-
| interval:ImplicitPromoteverregsing|style="vertical-aligncolor:topred" | An interval operation has been evaluated on both, a bare and a decorated interval. The bare interval has been converted into a decorated interval in order to produce a decorated result. Note: This warning does not occur if a bare interval literal string gets promoted into a decorated interval, e. g., trapped| dependency <code>infsupdec (1, 2) + "[3, 4]"verifylss</code> does not produce this warning whereas is implemented as <code>infsupdec (1, 2) + infsup (3, 4)mldivide</code> does.|style="vertical-align:top" | The implicit conversion applies the best possible decoration for the bare interval. If the bare interval has been produced from an interval arithmetic computation, this branch of computation is not covered by the decoration information and the final decoration could be considered wrong. For example, ; depends on <code>isspd</code>infsupdec (1by Rump, 2to be checked) + infsup (0, 1) ^ 0and </code> would ignore that 0verintervalhull<sup/code>0<; see also [http://uivtx.cs.cas.cz/~rohn/publist/sup> is undefinedsingreg.pdf]
|-
| interval:FixedDecoration|style="vertical-align:top" | During interval construction the desired decoration of the interval has been changed. An unbound interval cannot carry the ''common'' decoration. An empty interval must carry the ''trivial'' decoration.|stylecolspan="vertical-align:top3" | The interval's decoration is degraded as necessary. The input for the interval constructor could be considered illegal, e. g. [0, Inf]_com is no valid decorated interval literal.|} === Decorations ===The interval package provides a powerful decoration system for intervals, as specified by the IEEE standard for interval arithmetic. By default any interval carries a decoration, which collects additional information about the course of function evaluation on the interval data. Only the Interval (unfavoredor real) <code>infsup</code> constructor creates bare, undecorated intervals and the <code>intervalpart</code> operation may be used to demote decorated intervals into bare, undecorated ones. It is highly recommended to always use the decorated interval arithmetic, which gives additional information about an interval result in exchange for a tiny overhead. The following decorations are availabledata{| class="wikitable" style="marginMatrices: auto"!Decoration!Bounded!Continuous!Defined!DefinitionEigenvalues and singular values
|-
| com<br/>(common)vereigsym| style="text-aligncolor: centerred" | trapped| main part implemented in <code>vereig</code>, depends on <code style="text-aligncolor: centerred" | ✓| style="text-align: center" | ✓| '''''x''''' is a bounded, nonempty subset of Dom(''f''); ''f'' is continuous at each point of '''''x'''''; and the computed interval ''f''('''''x''''') is bounded>verspectrad</code>
|-
| dac<br/>(defined &amp; continuous)|vereigval| style="text-aligncolor: centerred" | trapped| depends on <code style="text-aligncolor: centerred" | ✓| '''''x''''' is a nonempty subset of Dom(''f''); and the restriction of ''f'' to '''''x''''' is continuous>verregsing</code>
|-
| def<brs>vereigvec</s>(defined)||| style="text-aligncolor: centergreen" | | '''''x''''' is a nonempty subset of Dom(''f'')free, migrated
|-
| trv<br/>(trivial)verperrvec|style="color:green"|free|| always true (so gives no information)the function is just a wrapper around <code style="color:green">vereigvec</code>?!?
|-
| ill<br/>(ill-formed)versingval|||| Not an interval, at least one interval constructor failed during the course of computation|} The decoration information is especially useful after a very long and complicated function evaluation. For example, when the “def” decoration survives until the final result, it is proven that the overall function is actually defined for all values covered by the input intervals. {{Code|Examples of using the decoration system|<syntaxhighlight langstyle="octavecolor:red">x = infsupdec (3, 4) # [3, 4]_comy = x - 3.5 # [-.5, +.5]_com## The square root function ignores any negative part of the input,## but the decoration indicates whether this has or has not happened.sqrt (x) # [1.7320508075688771, 2]_comsqrt (y) # [0, .7071067811865476]_trv</syntaxhighlight>}} === Specialized interval constructors ===Above mentioned interval construction with decimal numbers or numeric data is straightforward. Beyond that, there are more ways to define intervals or interval boundaries.* Hexadecimal-floating-constant form: Each interval boundary may be defined by a hexadecimal number (optionally containing a point) and an exponent field with an integral power of two as defined by the C99 standard ([http://www.open-std.org/jtc1/sc22/WG14/www/docs/n1256.pdf ISO/IEC9899, N1256, §6.4.4.2]). This can be used as a convenient way to define interval boundaries in double-precision, because the hexadecimal form is much shorter than the decimal representation of many numbers.* Rational literals: Each interval boundary may be defined as a fraction of two decimal numbers. This is especially useful if interval boundaries shall be tightest enclosures of fractions, that would be hard to write down as a decimal number.* Uncertain form: The interval as a whole can be defined by a midpoint or upper/lower boundary and an integral number of [http://en.wikipedia.org/wiki/Unit_in_the_last_place “units in last place” (ULPs)] as an uncertainty. The format is <code>''m''?''ruE''</code>, where** <code>''m ''</code> is a mantissa in decimal,** <code>''r ''</code> is either empty (which means ½ ULP) or is a non-negative decimal integral ULP count or is the <code>?</code> character (for unbounded intervals),** <code>''u ''</code> is either empty (symmetrical uncertainty of ''r'' ULPs in both directions) or is either <code>u</code> (up) or <code>d</code> (down),** <code>''E ''</code> is either empty or an exponent field comprising the character <code>e</code> followed by a decimal integer exponent (base 10). {{Code|Examples of different formats during interval construction|<syntaxhighlight lang="octave">infsup ("0x1.999999999999Ap-4") # hex-form # [.1, .10000000000000001]infsup ("1/3", "7/9") # rational form # [.33333333333333331, .7777777777777778]infsup ("121.2?") # uncertain form # [121.14999999999999, 121.25]infsup ("5?32e2") # uncertain form with ulp count # [-2700, +3700]infsup ("-42??u") # unbound uncertain form # [-42, +Inf]</syntaxhighlight>}} === Reverse arithmetic operations ===trapped[[File:Reverse-power-functions.png|400px|thumb|right|Reverse power operations. A relevant subset of the function's domain is outlined and hatched. In this example we use ''x''<sup>''y''</sup> ∈ [2, 3].]] Some arithmetic functions also provide reverse mode operations. That is inverse functions with interval constraints. For example the <code>sqrrev</code> can compute the inverse of the <code>sqr</code> function depends on intervals. The syntax is <code>sqrrev (C, X)</code> and will compute the enclosure of all numbers ''x'' ∈ X that fulfill the constraint ''x''² ∈ C. In the following example, we compute the constraints for base and exponent of the power function <code>pow</code> as shown in the figure. <span style="opacity:.5">octave:1> </span>x = powrev1 (infsup ("[1.1, 1.45]"), infsup (2, 3)) x ⊂ [1.6128979635153646, 2.7148547265657915] <span style="opacity:.5">octave:2> </span>y = powrev2 (infsup ("[2.14, 2.5]"), infsup (2, 3)) y ⊂ [.7564707973660299, 1.4440113978403284] === Tips & Tricks ===For convenience it is possible to implicitly call the interval constructor during all interval operations if at least one input already is an interval object.  <span style="opacity:.5">octave:1> </span>infsupdec ("17.7") + 1 ans ⊂ [18.699999999999999, 18.700000000000003]_com <span style="opacity:.5">octave:2> </span>ans + "[0, 2]" ans ⊂ [18.699999999999999, 20.700000000000003]_com Interval functions with only one argument can be called by using property syntax, e. g. <code>x.inf</code>, <code>x.sup</code> or even <code>x.sqr</code>. When matrices are resized using subscripted assignment, any implicit new matrix elements will carry an empty interval. <span style="opacitycolor:.5red">octave:1> </span>M = infsup (magic (3)); M (4, 4) = 42 M = 4×4 interval matrix [8] [1] [6] [Empty] [3] [5] [7] [Empty] [4] [9] [2] [Empty] [Empty] [Empty] [Empty] [42] Whilst most functions (<code>size</code>, <code>isvector</code>, <code>ismatrixvereigsym</code>, …) work as expected on interval data types, the function <code>isempty</code> is evaluated element-wise and checks if an interval equals the empty set. <span style="opacity:.5">octave:1> </span>builtin ("isempty", empty ()), isempty (empty ()) ans = 0 ans = 1 == IEEE 1788 index == {| class="wikitable" style="margin: auto; min-width: 50%"|+ In terms of a better integration into the GNU Octave language, several operations use a function name which is different from the name proposed in the standard document.!IEEE 1788!GNU Octave
|-
| newDeccolspan="3"| infsupdec [httpInterval (or real) data://octave.sourceforge.net/interval/function/@infsupdec/infsupdec.html]Matrices: Decompositions
|-
| setDecverqr (experimental)| infsupdecstyle="color:green"| free| <code>qr</code> has already been implemented using the Gram-Schmidt process, which seems to be more accurate and faster than the Cholsky decomposition or Householder reflections used in verqr. No migration needed.
|-
| numsToInterval<s>verchol (experimental)</s>| infsup [httpstyle="color://octave.sourceforge.net/interval/green"| free, migrated| migrated version has been named after the standard Octave function<code>chol</@infsup/infsup.html]code>
|-
| textToIntervalcolspan="3"| infsup ''Interval (or''<br/>infsupdecreal) data: Linear systems (square)
|-
| exp10verenclinthull| pow10 [httpstyle="color://octave.sourceforge.net/interval/function/@infsup/pow10.html]green"| free| to be migrated
|-
| exp2verhullparam| pow2 [httpstyle="color:green"| free| depends on <code>verintervalhull<//octave.sourceforge.net/interval/function/@infsup/pow2.html]code>, to be migrated
|-
| recipverhullpatt| inv [httpstyle="color:green"| free| depends on <code>verhullparam<//octave.sourceforge.net/interval/function/@infsup/inv.html]code>, to be migrated
|-
| sqrtverintervalhull| realsqrt [httpstyle="color://octave.sourceforge.net/interval/function/@infsup/realsqrt.html]green"| free| to be migrated
|-
| rootncolspan="3"| nthroot [httpInterval (or real) data://octave.sourceforge.net/interval/function/@infsup/nthroot.html]Linear systems (rectangular)
|-
| logp1verintlinineqs| log1p [httpstyle="color:green"| free| depends on <code style="color:green">verlinineqnn<//octave.sourceforge.net/interval/function/@infsup/log1p.html]code>
|-
| roundTiesToAwayveroettprag| round [httpstyle="color://octave.sourceforge.net/interval/function/@infsup/round.html]green"| free
|-
| roundTiesToEvenvertolsol| roundb [httpstyle="color:green"| free| depends on <code style="color:green">verlinineqnn<//octave.sourceforge.net/interval/function/@infsup/roundb.html]code>
|-
| trunccolspan="3"| fix [httpInterval (or real) data://octave.sourceforge.net/interval/function/@infsup/fix.html]Matrix equations (rectangular)
|-
| sumvermatreqn| on intervalsstyle="color: sum [http://octave.sourceforge.net/interval/function/@infsup/sum.html]<br/>on numbers: mpfr_vector_sum_d [http://octave.sourceforge.net/interval/function/mpfr_vector_sum_d.html]green"| free
|-
| dotcolspan="3"| on intervalsReal data only: dot [http://octave.sourceforge.net/interval/function/@infsup/dot.html]<br/>on numbers: mpfr_vector_dot_d [http://octave.sourceforge.net/interval/function/mpfr_vector_dot_d.html]Uncommon problems
|-
| sumAbsplusminusoneset| on intervalsstyle="color: sumabs [http://octave.sourceforge.net/interval/function/@infsup/sumabs.html]<br/>on numbers: use mpfr_vector_sum_d (''roundingMode'', abs (''x''))green"| free
|-
| sumSquareverabsvaleqn| on intervalsstyle="color: sumsq [http://octave.sourceforge.net/interval/function/@infsup/sumsq.html]<br>on numbers: use mpfr_vector_dot_d (''roundingMode'', abs (''x''), abs (''x''))green"| free| to be migrated
|-
| intersectionverabsvaleqnall| and (style="color:green"| free| depends on <code>&verabsvaleqn</code>, see also [http://octaveuivtx.sourceforgecs.net/intervalcas.cz/function~rohn/@infsuppublist/andabsvaleqnall.htmlpdf], to be migrated
|-
| convexHullverbasintnpprob| or (style="color:red"| trapped| depends on <codestyle="color:red">&#x007C;verregsing</code>) [http://octave.sourceforge.net/interval/function/@infsup/or.html]
|-
| mulRevToPair
| mulrev [http://octave.sourceforge.net/interval/function/@infsup/mulrev.html] ''with two output parameters''
|}
== Compatibility ==
 
The interval package's main goal is to be compliant with IEEE 1788, so it is compatible with other standard-conforming implementations (on the set of operations described by the standard document).
 
This interval package is ''not'' meant to be a replacement for INTLAB and any compatibility with it is pure coincidence. Since both are compatible with GNU Octave, they happen to agree on many function names and programs written for INTLAB may possibly run with this interval package as well. Some fundamental differences that I am currently aware of:
* INTLAB is non-free software, it grants none of the [http://www.gnu.org/philosophy/free-sw.html four essential freedoms] of free software
* INTLAB is not conforming to IEEE 1788 and the parsing of intervals from strings uses a different format—especially for the uncertain form
* INTLAB supports intervals with complex numbers and sparse interval matrices, but no empty intervals
* INTLAB uses inferior accuracy for most arithmetic operations, because it focuses on speed
* Basic operations can be found in both packages, but the availability of special functions depends
 
{{Code|In GNU Octave the interval package can also be run alongside INTLAB.|<syntaxhighlight lang="octave">
# INTLAB intervals
A1 = infsup (2, 3);
B1 = hull (-4, A1);
C1 = midrad (0, 2);
# Interval package intervals
pkg load interval
A2 = infsup (2, 3);
B2 = hull (-4, A2);
C2 = midrad (0, 2);
pkg unload interval
# Computation with INTLAB
A1 + B1 * C1
# Computation without INTLAB
A2 + B2 * C2
</syntaxhighlight>
}}
 
== Related work ==
 
For C++ there is an open source interval library [https://github.com/nehmeier/libieeep1788/ libieeep1788] by Marco Nehmeier (member of IEEE P1788). It aims to be standard compliant with IEEE 1788 and is designed in a modular way, supporting several interval data types and different flavors of interval arithmetic [http://www.youtube.com/watch?v=GOa9aWAZO_Q]. The GNU Octave interval package shares several unit tests with libieeep1788.
 
For C++, Pascal and Fortran there is a free interval library [http://www2.math.uni-wuppertal.de/~xsc/xsc-sprachen.html XSC]. It is not standard compliant with IEEE 1788. Some parts of the GNU Octave interval package have been derived from C-XSC.
 
For Java there is a library [https://java.net/projects/jinterval/ jinterval] by Dmitry Nadezhin (member of IEEE P1788). It aims to be standard compliant with IEEE 1788, but is not complete yet.
 
For MATLAB there is a popular, nonfree interval arithmetic toolbox [http://www.ti3.tu-harburg.de/rump/intlab/ INTLAB] by Siegfried Rump. It had been free of charge for academic use in the past, but no longer is. Its origin dates back to 1999, so it is well tested and comprises a lot of functionality, especially for vector / matrix operations. INTLAB is compatible with GNU Octave since Version 9 [http://www.ti3.tuhh.de/rump/intlab/Octave/octave.html].
[[Category:Octave-Forge]]

Navigation menu