PROFIL (Programmer’s Runtime Optimized Fast Interval Library) is a C++ class library supporting the most commonly needed interval and real operations in a user friendly way. The supported data types are currently: INT, REAL, INTERVAL, vectors and matrices of these types, and complex numbers. PROFIL is based on BIAS (Basic Interval Arithmetic Subroutines). The developement of BIAS was guided by the ideas of BLAS, i.e. to provide an interface for basic vector and matrix operations with specific and fast implementations on various machines, the latter frequently provided by the manufacturers. The idea of BIAS is to give such an interface for interval operations with the objective: very efficient use of the underlying hardware; portability; independency of a specific interval representation

References in zbMATH (referenced in 107 articles , 1 standard article )

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

1 2 3 4 5 6 next

  1. Fernández, José; Gazdag- Tóth, Boglárka; Redondo, Juana L.; Ortigosa, Pilar M.: The probabilistic customer’s choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane (2019)
  2. Domes, Ferenc; Goldsztejn, Alexandre: A branch and bound algorithm for quantified quadratic programming (2017)
  3. Fernández, José; Tóth, Boglárka G.; Redondo, Juana L.; Ortigosa, Pilar M.; Arrondo, Aránzazu Gila: A planar single-facility competitive location and design problem under the multi-deterministic choice rule (2017)
  4. Ninin, Jordan: Global optimization based on contractor programming: an overview of the IBEX library (2016)
  5. Pérez-Galván, Carlos; Bogle, I. David L.: Dynamic global optimization methods for determining guaranteed solutions in chemical engineering (2016)
  6. Walter F. Mascarenhas: Moore: Interval Arithmetic in Modern C++ (2016) arXiv
  7. Redondo, Juana L.; Fernández, José; Domingo Álvarez Hervás, José; Gila Arrondo, Aránzazu; Ortigosa, Pilar M.: Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem (2015)
  8. Fernández, José; Salhi, Said; -Tóth, Boglárka G.: Location equilibria for a continuous competitive facility location problem under delivered pricing (2014)
  9. Goldsztejn, Alexandre; Cruz, Jorge; Carvalho, Elsa: Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities (2014)
  10. Goualard, Frédéric: How do you compute the midpoint of an interval? (2014)
  11. Maïga, Moussa; Ramdani, Nacim; Travé-Massuyès, Louise; Combastel, Christophe: A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability (2014)
  12. Rego, Francisco; De Weerdt, Elwin; van Oort, Eddy; van Kampen, Erik-Jan; Chu, Qiping; Pascoal, António M.: Determination of inner and outer bounds of reachable sets through subpavings (2014)
  13. Fazal, Qaisra; Neumaier, Arnold: Error bounds for initial value problems by optimization (2013)
  14. Rump, Siegfried M.: Accurate solution of dense linear systems. II: Algorithms using directed rounding (2013)
  15. Rump, Siegfried M.: Fast interval matrix multiplication (2012)
  16. Saidani, Nasreddine; Chu, Feng; Chen, Haoxun: Competitive facility location and design with reactions of competitors already in the market (2012)
  17. Pedamallu, Chandra Sekhar; Ozdamar, Linet: Solving kinematics problems by efficient interval partitioning (2011)
  18. Revol, Nathalie: Standardized interval arithmetic and interval arithmetic used in libraries (2010)
  19. Rump, Siegfried M.: Verification methods: rigorous results using floating-point arithmetic (2010)
  20. Stradi-Granados, Benito A.; Haven, Emmanuel: The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method (2010)

1 2 3 4 5 6 next