PROFIL/BIAS - A fast interval library

DOI10.1007/BF02307379zbMath0808.65055OpenAlexW53809769MaRDI QIDQ1340873

Publication date: 20 December 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02307379

zbMATH Keywords

BLAS LAPACK directed roundings performance results PROFIL \(\text{C}^{++}\)basic interval arithmetic subroutines basic linear algebraic subprograms BIAS IEEE-754 arithmetic standard IMSL NAG programmer's runtime optimized fast interval library vector and matrix operations

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Packaged methods for numerical algorithms (65Y15)

Related Items

Algorithmic differentiation techniques for global optimization in the COCONUT environment, 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 NUMERICAL COMPUTATIONS FOR EIGENVALUES OF NON-COMMUTATIVE HARMONIC OSCILLATORS, The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane, An Approach to The Numerical Verification of Solutions for Nonlinear Elliptic Problems With Local Uniqueness, Verified Analysis of a Biomechanics-Related System, Numerical verification method of solutions for elliptic equations and its application to the Rayleigh-Bénard problem, Validated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP, Verified solution of large systems and global optimization problems, Location equilibria for a continuous competitive facility location problem under delivered pricing, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem, A planar single-facility competitive location and design problem under the multi-deterministic choice rule, Interval modeling of dynamics for multibody systems, Solving a huff-like competitive location and design model for profit maximization in the plane, A branch and bound algorithm for quantified quadratic programming, Constrained global optimization for wine blending, Uses of New Sensitivity and Dae Solving Methods in SmartMobile for Verified Analysis of Mechanical Systems, Variable-precision, interval arithmetic coprocessors, Software for high radix on-line arithmetic, Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems, Numerical method for verifying the existence and local uniqueness of a double turning point for a radially symmetric solution of the perturbed Gelfand equation, A Case for Interval Hardware on Superscalar Processors, Guaranteed Set Computation with Subpavings, 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, Verified stability analysis of continuous-time control systems with bounded parameter uncertainties and stochastic disturbances, Dynamic Global Optimization Methods for Determining Guaranteed Solutions in Chemical Engineering, Heuristic rejection in interval global optimization, Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods, Competitive facility location and design with reactions of competitors already in the market, Multiple solutions for a semilinear boundary value problem: a computational multiplicity proof., Fast interval matrix multiplication, Global optimization of bounded factorable functions with discontinuities, Solving kinematics problems by efficient interval partitioning, Verified computations of solutions for nondifferentiable elliptic equations related to MHD equilibria, A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability, 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, Solution of a transcendental eigenvalue problem via interval analysis, 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, Global optimization of generalized semi-infinite programs using disjunctive programming, SmartMOBILE and its Applications to Guaranteed Modeling and Simulation of Mechanical Systems, Efficient interval partitioning for constrained global optimization, First order rejection tests for multiple-objective optimization, Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models, 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, Numerical verifications for eigenvalues of second-order elliptic operators, New interval methods for constrained global optimization, Mathematically rigorous global optimization in floating-point arithmetic, Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms, Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities, Solving a Huff-like Stackelberg location problem on networks, The Forthcoming IEEE Standard 1788 for Interval Arithmetic, Curve Veering for the Parameter-dependent Clamped Plate, PROFIL/BIAS, A robust and efficient algorithm for planar competitive location problems, The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems, 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, How do you compute the midpoint of an interval?, Computational proofs of the existence of solutions to elasto-plastic torsion problems, Comparison of four software packages applied to a scattering problem, 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, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, The design of the Boost interval arithmetic library

Uses Software

Cites Work