A lower bound for range enclosure in interval arithmetic
From MaRDI portal
Recommendations
- Interval arithmetic with containment sets
- scientific article; zbMATH DE number 6260291
- Mathematical Foundations of Computer Science 2003
- Interval arithmetic over finitely many endpoints
- Lower bounds for arithmetic problems
- An analysis of arithmetic constraints on integer intervals
- An improved lower bound for arithmetic regularity
- Recent Advances in Constraints
- An algorithm to compute sets enclosingM-numerical ranges with applications in numerical analysis
- scientific article; zbMATH DE number 903769
Cites work
- A sufficient condition for non-overestimation in interval arithmetic
- Computing the range of values of real functions with accuracy higher than second order
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- 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 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 4197279 (Why is no real title available?)
- scientific article; zbMATH DE number 3281218 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3295652 (Why is no real title available?)
- On higher order centered forms
- On the approximation of the range of values by interval expressions
- The basic properties of interval arithmetic, its software realizations and some applications
- The centered form and the mean value form - a necessary condition that they yield the range
Cited in
(18)- Sharpness in interval computations
- An interval algorithm for bounding the ranges of real-valued functions of one real variable
- Error reduction of the Taylor centered form by half and an inner estimation of the range
- A sufficient condition for non-overestimation in interval arithmetic
- Interval analysis: Theory and applications
- Horner's rule for interval evaluation revisited
- Using Markov's interval arithmetic to evaluate Bessel-Riccati functions
- Interval methods that are guaranteed to underestimate (and the resulting new justification of Kaucher arithmetic)
- A general reliable quadratic form: An extension of affine arithmetic
- Interval Stabbing Problems in Small Integer Ranges
- scientific article; zbMATH DE number 3926094 (Why is no real title available?)
- scientific article; zbMATH DE number 3960879 (Why is no real title available?)
- An algorithm to compute sets enclosingM-numerical ranges with applications in numerical analysis
- scientific article; zbMATH DE number 799224 (Why is no real title available?)
- scientific article; zbMATH DE number 4197279 (Why is no real title available?)
- Large-Scale Scientific Computing
- A limitation for underestimation via twin arithmetic
- Automatic computation of a linear interval enclosure
This page was built for publication: A lower bound for range enclosure in interval arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603894)