Acknowledgments

The GNU Octave interval package is build upon great third-party software.

• Most correctly rounded arithmetic operations are based on the GNU MPFR library by Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Philippe Théveny and Paul Zimmermann.
• Several correctly rounded arithmetic operations are based on the correctly rounded math library by Jean-Michel Muller, Florent de Dinechin, Christoph Lauter, David Defour, Catherine Daramy-Loirat, Matthieu Gallet, and Nicolas Gast.
• Jiří Rohn has published his comprehensive verification toolbox VERSOFT as free software on July 26, 2016. On November 24 he has fully disclosed the source code and several high-level functions could be included in the interval package with minor adjustments, e. g., @infsup/chol, vereigvec, and verlinprog. Also, many thanks to Vladik Kreinovich who has helped to clear the licensing issue with VERSOFT.
• A linear system solver @infsup/mldivide and a polynomial evaluation algorithm @infsup/polyval for bare intervals are derived from routines developed for C-XSC at University of Wuppertal, Germany.
• Introduction to Interval Arithmetic is partly based on the documentation for the former SIMP package for Octave by Simone Pernice.
• A French translation of the package description has been made by Rodéric Moitié.
• In the Examples for finding root enclosures a function and code by Helmut Podhaisky has been used.
• The online course on interval analysis by Luc Jaulin and Jordan Ninin at ENSTA-Bretagne has inspired me to implement the set inversion algorithms in @infsup/fsolve.
• I have gained access to scientific literature thanks to the Weihenstephan-Triesdorf University of Applied Sciences.
• Most unit tests are written in portable ITL format and converted into GNU Octave test cases with the Interval Testing Framework for IEEE 1788. The framework has been developed by Maximilian Kiesner and Marco Nehmeier, Chair of Software Engineering, Department of Computer Science, University of Würzburg, Germany.
• Several unit tests are derived from libieeep1788, a C++ implementation of IEEE Std 1788-2015, IEEE standard for interval arithmetic. The library contains several unit tests for its IEEE 754 flavor, which is compatible with the arithmetic of the GNU Octave interval package. I have converted nearly 6000 of these test cases into portable ITL format for verification of this package.

  libieeep1788
  ============
  
  Copyright 2013 - 2015
  
  Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de)
  Department of Computer Science,
  University of Wuerzburg, Germany
  
  This product includes software developed at
  Chair of Software Engineering,
  Department of Computer Science,
  University of Wuerzburg, Germany
  http://se.informatik.uni-wuerzburg.de/
  

• Several unit tests are derived from MPFI, a C++ interval arithmetic library based on GNU MPFR. The library contains several unit tests for binary64 numbers, which are compatible with the arithmetic of the GNU Octave interval package. I have converted nearly 1500 of these test cases into portable ITL format for verification of this package.
• Several unit tests are derived from FI_LIB, an ANSI-C interval arithmetic library based on binary64 numbers. The library contains several unit tests, which are compatible with the arithmetic of the GNU Octave interval package. I have converted 800 of these test cases into portable ITL format for verification of this package.
• Some unit tests are derived from C-XSC, a C++ class library for interval arithmetic. The library contains some unit tests, which are compatible with the arithmetic of the GNU Octave interval package. I have converted 160 of these test cases into portable ITL format for verification of this package.
• Fast matrix multiplication (see @infsup/mtimes) as well as the linear system solver (see @infsup/mldivide) use BLAS routines with directed rounding. An OCT-file interface for setting the rounding mode has been developed by Kai Torben Ohlus, Institute for Reliable Computing, Hamburg University of Technology, Germany.

Last, but not least, many thanks to everybody who has contributed to the success of free software!