Fast algorithms for floating-point interval matrix multiplication
From MaRDI portal
Three fast algorithms for computing a verified product of interval matrices are presented and compared.
Recommendations
Cites work
- Accuracy and Stability of Numerical Algorithms
- Computational error bounds for multiple or nearly multiple eigenvalues
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Fast inclusion of interval matrix multiplication
- Fast interval matrix multiplication
- Fast verification of solutions of matrix equations
- scientific article; zbMATH DE number 1440908 (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 961607 (Why is no real title available?)
- Verification methods: rigorous results using floating-point arithmetic
Cited in
(9)- Fast multiplication of interval matrices (Interval version of Strassen's algorithm)
- Fast inclusion of interval matrix multiplication
- Interval arithmetic for nonlinear problem solving
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- Fast interval matrix multiplication
- Solving a sparse system using linear algebra
- Numerical Computations and Computer Assisted Proofs of Periodic Orbits of the Kuramoto--Sivashinsky Equation
- Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
This page was built for publication: Fast algorithms for floating-point interval matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428100)
