Fast inclusion of interval matrix multiplication
From MaRDI portal
Publication:2484077
Recommendations
- Fast interval matrix multiplication
- scientific article; zbMATH DE number 1639667
- Fast algorithms for floating-point interval matrix multiplication
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm)
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A set of level 3 basic linear algebra subprograms
- Automated empirical optimizations of software and the ATLAS project
- Computational error bounds for multiple or nearly multiple eigenvalues
- Fast and parallel interval arithmetic
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Fast verification of solutions of matrix equations
- On the solution of interval linear systems
- The Arithmetic of the Digital Computer: A New Approach
Cited in
(9)- Improvement of error-free splitting for accurate matrix multiplication
- An algorithm for automatically selecting a suitable verification method for linear systems
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- Optimal multiplication of \(G\)-intervals
- Fast algorithms for floating-point interval matrix multiplication
- Error estimation of floating-point summation and dot product
- Fast verified solutions of linear systems
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm)
- Fast interval matrix multiplication
This page was built for publication: Fast inclusion of interval matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484077)
