The author discusses various methods for the multiplication of point and/or interval matrices with interval result. Some are based on new a priori estimates of the error of floating-point matrix products. The amount of overestimation including all rounding errors is analyzed. In particular, algorithms for conversion of infimum-supremum to midpoint-radius representation are studied, one of which is proved to be optimal. All methods are much faster than the classical method because almost no switch of the rounding mode is necessary, and because the methods are based on highly optimized BLAS3 routines. Several possibilities are discussed to trade overestimation against computational effort. Numerical examples are presented focussing in particular on applications using interval matrix multiplications.
- Fast algorithms for floating-point interval matrix multiplication
- Fast inclusion of interval matrix multiplication
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm)
- Fast and parallel interval arithmetic
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- A computer-assisted instability proof for the Orr-Sommerfeld problem with Poiseuille flow
- A computer-assisted proof for the Kolmogorov flows of incompressible viscous fluid
- A numerical approach to the proof of existence of solutions for elliptic problems
- A numerical method to verify the invertibility of linear elliptic operators with applications to nonlinear problems
- A set of level 3 basic linear algebra subprograms
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Checking robust nonsingularity is NP-hard
- Circular arithmetic and the determination of polynomial zeros
- Error estimation of floating-point summation and dot product
- Existence and multiplicity proofs for semilinear elliptic boundary value problems by computer assistance
- Fast and parallel interval arithmetic
- Fast verification of solutions of matrix equations
- Handbook of Floating-Point Arithmetic
- How do you compute the midpoint of an interval?
- scientific article; zbMATH DE number 3682951 (Why is no real title available?)
- scientific article; zbMATH DE number 524105 (Why is no real title available?)
- scientific article; zbMATH DE number 802434 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 226866 (Why is no real title available?)
- Interval Methods for Systems of Equations
- Inversion of extremely ill-conditioned matrices in floating-point
- Numerical existence proofs and explicit bounds for solutions of nonlinear elliptic boundary value problems
- On accurate floating-point summation
- Pitfalls in Computation, or why a Math Book isn't Enough
- PROFIL/BIAS - A fast interval library
- Verification methods: rigorous results using floating-point arithmetic
- Fast rectangular matrix multiplication and applications
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm)
- Interval tensors and their application in solving multi-linear systems of equations
- Modified error bounds for approximate solutions of dense linear systems
- Fast algorithms for floating-point interval matrix multiplication
- Optimal multiplication of \(G\)-intervals
- Fast inclusion of interval matrix multiplication
- New formulae for multiplication of intervals
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- Fast Output-Sensitive Matrix Multiplication
- Faster Online Matrix-Vector Multiplication
- Numerical Computations and Computer Assisted Proofs of Periodic Orbits of the Kuramoto--Sivashinsky Equation
- Large-Scale Scientific Computing
- IEEE-754 precision-\(p\) base-\(\beta\) arithmetic implemented in binary
- Fast matrix multiplication is stable
Uses Software
This page was built for publication: Fast interval matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q451807)
