filib++

filib++ is an extension of the interval library filib. The most important aim of the latter was the fast computation of guaranteed bounds for interval versions of a comprehensive set of elementary function. filib++ extends this library in two aspects. First, it adds a second mode, the ”extended” mode, that extends the exception-free computation mode using special values to represent infinities and NotaNumber known from the IEEE floating-point standard 754 to intervals. In this mode so-called containment sets are computed to enclose the topological closure of a range of a function defined over an interval. Second, state of the art design uses templates and traits classes in order to get an efficient, easily extendable and portable library, fully according to the C++ standard


References in zbMATH (referenced in 29 articles )

Showing results 1 to 20 of 29.
Sorted by year (citations)

1 2 next

  1. Ninin, Jordan: Global optimization based on contractor programming: an overview of the IBEX library (2016)
  2. Delanoue, Nicolas; Lagrange, Sébastien: A numerical approach to compute the topology of the apparent contour of a smooth mapping from $\BbbR^2$ to $\BbbR^2$ (2014)
  3. Goualard, Frédéric: How do you compute the midpoint of an interval? (2014)
  4. Jézéquel, Fabienne; Langlois, Philippe; Revol, Nathalie: First steps towards more numerical reproducibility (2014)
  5. Kyurkchiev, Nikolay; Iliev, Anton: A refinement of some overrelaxation algorithms for solving a system of linear equations (2013)
  6. Golev, Angel; Malinova, Anna; Zaharieva, Desislava: Software implementation of modifications of iterative algorithms for solving linear systems of equations (2012)
  7. Nehmeier, Marco: Interval arithmetic using expression templates, template meta programming and the upcoming C++ standard (2012)
  8. Krämer, Walter: Computer-assisted proofs and symbolic computations (2010)
  9. Neher, Markus: Complex inclusion functions in the CoStLy C++ class library (2010)
  10. Popova, Evgenija D.; Krämer, Walter: Communicating functional expressions from Mathematica to C-XSC (2010)
  11. Smith, Andrew Paul: Fast construction of constant bound functions for sparse polynomials (2009)
  12. Corliss, George F.; Kearfott, R.Baker; Nedialkov, Ned; Pryce, John D.; Smith, Spencer: Interval subroutine library mission (2008)
  13. Lambov, Branimir: Interval arithmetic using SSE-2 (2008)
  14. Krämer, Walter: Introduction to the Maple Power Tool intpakX (2007)
  15. Petras, Knut: Principles of verified numerical integration (2007)
  16. Beelitz, Thomas; Lang, Bruno; Bischof, Christian H.: Efficient task scheduling in the parallel result-verifying solution of nonlinear systems (2006)
  17. Pryce, J.D.; Corliss, G.F.: Interval arithmetic with containment sets (2006)
  18. Revol, Nathalie; Rouillier, Fabrice: Motivations for an arbitrary precision interval arithmetic and the MPFI library (2005)
  19. Žilinskas, A.; Žilinskas, J.: On underestimating in interval computations (2005)
  20. Granvilliers, Laurent; Kreinovich, Vladik; Müller, Norbert: Novel approaches to numerical software with result verification (2004)

1 2 next