Fast and parallel interval arithmetic

From MaRDI portal
Publication:1307245

DOI10.1023/A:1022374804152zbMath0942.65048MaRDI QIDQ1307245

Siegfried Michael Rump

Publication date: 21 August 2000

Published in: BIT (Search for Journal in Brave)




Related Items

Tight and efficient enclosure of matrix multiplication by using optimized BLAS, Multi-step root solvers of Traub's type in real interval arithmetic, A blind digital image watermarking method based on the dyadic wavelet packet transform and fast interval arithmetic techniques, Fast verified solutions of linear systems, Interval Monte Carlo as an alternative to second-order sampling for estimating ecological risk, Interval iterative methods for computing Moore-Penrose inverse, Fast enclosing the solution set of the parametric Sylvester matrix equations, Computation of Algebraic Solutions to Interval Systems Via Systems of Coordinates, Simulation of a Controlled Aircraft Elevator under Sensor Uncertainties, On the algebraic Properties of Stochastic Arithmetic. Comparison to Interval Arithmetic, An efficient approach to solve very large dense linear systems with verified computing on clusters, The Laurent-Horner method for validated evaluation of Chebyshev expansions, Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations, An algorithm for automatically selecting a suitable verification method for linear systems, Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse, Computational complexity of iterated maps on the interval, Fast interval matrix multiplication, Computing Enclosures for the Matrix Exponential, Solving a sparse system using linear algebra, Bounding error of calculating the matrix functions, A blind digital image watermarking method based on the dyadic wavelet transform and interval arithmetic, Fast inclusion of interval matrix multiplication, Mathematically rigorous global optimization in floating-point arithmetic, Piecewise linear secant approximation via algorithmic piecewise differentiation, Enclosing Chebyshev Expansions in Linear Time, Modified error bounds for approximate solutions of dense linear systems, Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures, Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues, How do you compute the midpoint of an interval?, Fast convolution and fast Fourier transform under interval and fuzzy uncertainty, Motivations for an arbitrary precision interval arithmetic and the MPFI library


Uses Software