PROFIL/BIAS - A fast interval library
From MaRDI portal
BIAS are basic interval arithmetic subroutines which represent a sort of counterpart of the well-known basic linear algebraic subprograms called BLAS. The paper discusses a special implementation of BIAS in C using a lower/upper bound interval representation and directed roundings. This implementation is machine independent (and thus easily portable) with the exception of three small routines for switching the rounding mode. Significant savings of time have been achieved by programming vector and matrix operations in a particular way. Based on BIAS which are low-level routines a \(\text{C}^{++}\) library called PROFIL (Programmer's Runtime Optimized Fast Interval Library) is described improving memory management and allowing the direct use of standard libraries such as IMSL, NAG and LAPACK. Performance results are given proving the efficiency of PROFIL and BIAS. The paper is concluded by the addresses of the server and the directories from which both packages can be obtained via anonymous ftp.
Recommendations
Cites work
- A set of level 3 basic linear algebra subprograms
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
- An extended set of FORTRAN basic linear algebra subprograms
- Basic Linear Algebra Subprograms for Fortran Usage
- scientific article; zbMATH DE number 434845 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 52928 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 584485 (Why is no real title available?)
- scientific article; zbMATH DE number 804654 (Why is no real title available?)
- scientific article; zbMATH DE number 852342 (Why is no real title available?)
- Topics in validated computations. Proceedings of the IMACS-GAMM international workshop, Oldenburg, Germany, 30 August - 3 September 1993
Cited in
(76)- A robust and efficient algorithm for planar competitive location problems
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- 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
- Comparison of four software packages applied to a scattering problem
- PROFIL/BIAS
- Heuristic rejection in interval global optimization
- Multiple solutions for a semilinear boundary value problem: a computational multiplicity proof.
- Computational proofs of the existence of solutions to elasto-plastic torsion problems
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
- A computer-assisted proof on the stability of the Kolmogorov flows of incompressible viscous fluid
- Numerical method with guaranteed accuracy of a double turning point for a radially symmetric solution of the perturbed Gelfand equation
- Verified solution of large systems and global optimization problems
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Variable-precision, interval arithmetic coprocessors
- Software for high radix on-line arithmetic
- Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
- Solution of a transcendental eigenvalue problem via interval analysis
- First order rejection tests for multiple-objective optimization
- Numerical verifications for eigenvalues of second-order elliptic operators
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A branch and bound algorithm for quantified quadratic programming
- Constrained global optimization for wine blending
- Global optimization of bounded factorable functions with discontinuities
- Solving kinematics problems by efficient interval partitioning
- The 1-center problem in the plane with independent random weights
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- New interval methods for constrained global optimization
- Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- On the computation of invariant sets for constrained nonlinear systems: an interval arithmetic approach
- The Forthcoming IEEE Standard 1788 for Interval Arithmetic
- Curve veering for the parameter-dependent clamped plate
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Verified analysis of a biomechanics-related system
- Dynamic global optimization methods for determining guaranteed solutions in chemical engineering
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- SmartMOBILE and its applications to guaranteed modeling and simulation of mechanical systems
- Verified stability analysis of continuous-time control systems with bounded parameter uncertainties and stochastic disturbances
- An Approach to The Numerical Verification of Solutions for Nonlinear Elliptic Problems With Local Uniqueness
- Competitive facility location and design with reactions of competitors already in the market
- Fast interval matrix multiplication
- A case for interval hardware on superscalar processors
- Guaranteed set computation with subpavings
- Mathematically rigorous global optimization in floating-point arithmetic
- A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability
- VERIFIED NUMERICAL COMPUTATIONS FOR EIGENVALUES OF NON-COMMUTATIVE HARMONIC OSCILLATORS
- scientific article; zbMATH DE number 1440911 (Why is no real title available?)
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- Validated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP
- Interval Subroutine Library Mission
- Numerical Software with Result Verification
- How do you compute the midpoint of an interval?
- Verified computations of solutions for nondifferentiable elliptic equations related to MHD equilibria
- An enclosure method of eigenvalues for the elliptic operator linearized at an exact solution of nonlinear problems
- Computational error bounds for multiple or nearly multiple eigenvalues
- Solving a Huff-like Stackelberg location problem on networks
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Uses of new sensitivity and DAE solving methods in SmartMobile for verified analysis of mechanical systems
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Efficient acceleration strategies for interval branch-and-bound type methods
- The design of the Boost interval arithmetic library
- Numerical verification method of solutions for elliptic equations and its application to the Rayleigh-Bénard problem
- Interval modeling of dynamics for multibody systems
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Numerical method for verifying the existence and local uniqueness of a double turning point for a radially symmetric solution of the perturbed Gelfand equation
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Error bounds for initial value problems by optimization
- Efficient interval partitioning for constrained global optimization
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
Describes a project that uses
Uses Software
This page was built for publication: PROFIL/BIAS - A fast interval library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340873)
