PROFIL/BIAS - A fast interval library
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- Topics in validated computations. Proceedings of the IMACS-GAMM international workshop, Oldenburg, Germany, 30 August - 3 September 1993
Cited in
(74)- Global optimization of bounded factorable functions with discontinuities
- Constrained global optimization for wine blending
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- A branch and bound algorithm for quantified quadratic programming
- Solving a Huff-like Stackelberg location problem on networks
- The 1-center problem in the plane with independent random weights
- Numerical method with guaranteed accuracy of a double turning point for a radially symmetric solution of the perturbed Gelfand equation
- Solving kinematics problems by efficient interval partitioning
- On the computation of invariant sets for constrained nonlinear systems: an interval arithmetic approach
- 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
- Verified stability analysis of continuous-time control systems with bounded parameter uncertainties and stochastic disturbances
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Verified solution of large systems and global optimization problems
- Numerical Software with Result Verification
- Competitive facility location and design with reactions of competitors already in the market
- An enclosure method of eigenvalues for the elliptic operator linearized at an exact solution of nonlinear problems
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- An Approach to The Numerical Verification of Solutions for Nonlinear Elliptic Problems With Local Uniqueness
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- Multiple solutions for a semilinear boundary value problem: a computational multiplicity proof.
- Curve veering for the parameter-dependent clamped plate
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- The Forthcoming IEEE Standard 1788 for Interval Arithmetic
- 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
- Numerical verification method of solutions for elliptic equations and its application to the Rayleigh-Bénard problem
- Interval modeling of dynamics for multibody systems
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- Heuristic rejection in interval global optimization
- Mathematically rigorous global optimization in floating-point arithmetic
- Variable-precision, interval arithmetic coprocessors
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Dynamic global optimization methods for determining guaranteed solutions in chemical engineering
- Fast interval matrix multiplication
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- A case for interval hardware on superscalar processors
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Guaranteed set computation with subpavings
- How do you compute the midpoint of an interval?
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A computer-assisted proof on the stability of the Kolmogorov flows of incompressible viscous fluid
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Error bounds for initial value problems by optimization
- PROFIL/BIAS
- Numerical method for verifying the existence and local uniqueness of a double turning point for a radially symmetric solution of the perturbed Gelfand equation
- Numerical verifications for eigenvalues of second-order elliptic operators
- Computational error bounds for multiple or nearly multiple eigenvalues
- Efficient interval partitioning for constrained global optimization
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
- Interval Subroutine Library Mission
- Validated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP
- A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- The design of the Boost interval arithmetic library
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Uses of new sensitivity and DAE solving methods in SmartMobile for verified analysis of mechanical systems
- Verified computations of solutions for nondifferentiable elliptic equations related to MHD equilibria
- A robust and efficient algorithm for planar competitive location problems
- VERIFIED NUMERICAL COMPUTATIONS FOR EIGENVALUES OF NON-COMMUTATIVE HARMONIC OSCILLATORS
- First order rejection tests for multiple-objective optimization
- Computational proofs of the existence of solutions to elasto-plastic torsion problems
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Software for high radix on-line arithmetic
- Comparison of four software packages applied to a scattering problem
- Solution of a transcendental eigenvalue problem via interval analysis
- SmartMOBILE and its applications to guaranteed modeling and simulation of mechanical systems
- Verified analysis of a biomechanics-related system
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities
- New interval methods for constrained global optimization
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
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)
