Fast algorithms for floating-point interval matrix multiplication

DOI10.1016/j.cam.2011.10.011zbMath1248.65044OpenAlexW2121922636MaRDI QIDQ2428100

Takeshi Ogita, Shin'ichi Oishi, Katsuhisa Ozaki, Siegfried Michael Rump

Publication date: 24 April 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.10.011

zbMATH Keywords

interval arithmeticinterval matricesmatrix multiplicationverified computations

Mathematics Subject Classification ID

Related Items (4)

Interval arithmetic for nonlinear problem solving ⋮ 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 ⋮ Solving a sparse system using linear algebra ⋮ Numerical Computations and Computer Assisted Proofs of Periodic Orbits of the Kuramoto--Sivashinsky Equation

Uses Software

• Matlab
• INTLAB
• b4m
• mctoolbox
• Int4Sci

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast interval matrix multiplication
• Fast verification of solutions of matrix equations
• Fast inclusion of interval matrix multiplication
• Verification methods: Rigorous results using floating-point arithmetic
• Accuracy and Stability of Numerical Algorithms
• Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
• Computational error bounds for multiple or nearly multiple eigenvalues

This page was built for publication: Fast algorithms for floating-point interval matrix multiplication