Sharpness in interval computations
From MaRDI portal
Publication:1362822
DOI10.1023/A:1009917818868zbMath0881.65032OpenAlexW162001771MaRDI QIDQ1362822
Publication date: 16 February 1998
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009917818868
Related Items
On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems ⋮ Interval Monte Carlo as an alternative to second-order sampling for estimating ecological risk ⋮ The best interval representations of t-norms and automorphisms ⋮ A new neural network model for solving random interval linear programming problems ⋮ Relations between various methods for solving linear interval and parametric equations ⋮ Complexity of computing interval matrix powers for special classes of matrices. ⋮ A goal programming approach for solving the random interval linear programming problem ⋮ The optimal solution of an interval system of linear algebraic equations ⋮ Exact bounds on finite populations of interval data ⋮ Sharpening interval computations ⋮ The influence of interval arithmetic on the shape of uncertainly defined domains modelled by closed curves ⋮ Performance of convex underestimators in a branch-and-bound framework ⋮ Self-validated Computations for the Probabilities of the Central Bivariate Chi-square Distribution and a BivariateFDistribution. This work partially supported by National Science Foundation grant DMS-9500831 ⋮ Fast convolution and fast Fourier transform under interval and fuzzy uncertainty
