Motivations for an arbitrary precision interval arithmetic and the MPFI library
From MaRDI portal
Publication:2572919
DOI10.1007/s11155-005-6891-yzbMath1078.65543OpenAlexW2107996047MaRDI QIDQ2572919
Fabrice Rouillier, Nathalie Revol
Publication date: 7 November 2005
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00072090/file/RR-4498.pdf
Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)
Related Items (39)
A certified numerical algorithm for the topology of resultant and discriminant curves ⋮ Optimality for the two-parameter quadratic sieve ⋮ New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry ⋮ Rigorous computer-assisted application of KAM theory: a modern approach ⋮ Floating-point arithmetic ⋮ Recursive solution of initial value problems with temporal discretization ⋮ Multiple/arbitrary precision interval computations in C-XSC ⋮ ABS: A formally correct software tool for space-efficient symbolic synthesis ⋮ Testing interval arithmetic libraries, including their IEEE-1788 compliance ⋮ A domain-theoretic framework for robustness analysis of neural networks ⋮ Efficient and accurate computation of upper bounds of approximation errors ⋮ Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability ⋮ Stochastic arithmetic in multiprecision ⋮ On the sharpness of the Rüssmann estimates ⋮ Gevrey properties of the asymptotic critical wave speed in a family of scalar reaction-diffusion equations ⋮ Computational complexity of iterated maps on the interval ⋮ Standardization and testing of implementations of mathematical functions in floating point numbers ⋮ A certificate-based approach to formally verified approximations ⋮ A rigorous computational approach to linear response ⋮ On the classification of Kähler-Ricci solitons on Gorenstein del Pezzo surfaces ⋮ Exact bounded-error continuous-time linear state estimator ⋮ Computing the pessimism of inclusion functions ⋮ Certified non-conservative tests for the structural stability of discrete multidimensional systems ⋮ Bounds and algorithms for the -Bessel function of imaginary order ⋮ New predictor-corrector methods with high efficiency for solving nonlinear systems ⋮ Computing $\pi (x)$ analytically ⋮ A revision of the proof of the Kepler conjecture ⋮ Multistep high-order methods for nonlinear equations using Padé-like approximants ⋮ On the first sign change of $\theta (x) -x$ ⋮ Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry ⋮ Bifurcations of Central Configurations in the Four-Body Problem with Some Equal Masses ⋮ Computing Hypergeometric Functions Rigorously ⋮ Semidefinite characterization and computation of zero-dimensional real radical ideals ⋮ Preliminary orbit determination of artificial satellites: a vectorial sixth-order approach ⋮ Computer-assisted proofs in PDE: a survey ⋮ Motivations for an arbitrary precision interval arithmetic and the MPFI library ⋮ Existence of noise induced order, a computer aided proof ⋮ Linnik's approximation to Goldbach's conjecture, and other problems ⋮ New results for witnesses of Robin’s criterion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interval Newton method
- Bounding solutions of systems of equations using interval analysis
- Feasible real random access machines
- Solving zero-dimensional systems through the rational univariate representation
- Fast and parallel interval arithmetic
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Interval Newton iteration in multiple precision for the univariate case
- Efficient isolation of polynomial's real roots.
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Polynomial root finding using iterated Eigenvalue computation
- Interval arithmetic
- FILIB++, a fast interval library supporting containment computations
- Interval Methods for Systems of Equations
- Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
- Precise computation using range arithmetic, via C++
- On stopping criteria in verified nonlinear systems or optimization algorithms
- Verified high-order inversion of functional dependencies and interval Newton methods
This page was built for publication: Motivations for an arbitrary precision interval arithmetic and the MPFI library
