Reproducible and accurate matrix multiplication

DOI10.1007/978-3-319-31769-4_11zbMATH Open1354.65082OpenAlexW2412538644MaRDI QIDQ2803594FDOQ2803594

Authors: Roman Iakymchuk, David Defour, Sylvain Collange, Stef Graillat 

Publication date: 2 May 2016

Published in: Scientific Computing, Computer Arithmetic, and Validated Numerics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31769-4_11

Recommendations

• Algorithms for efficient reproducible floating point summation
• Efficiency of reproducible level 1 BLAS
• First steps towards more numerical reproducibility
• Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit

zbMATH Keywords

reproducibilitymatrix multiplicationaccuracyGPUserror-free transformationfloating-point expansionKulisch long accumulatorrounding-to-nearest

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cited In (8)

• Rectangular matrix multiplication revisited
• Error‐free transformation of matrix multiplication with a posteriori validation
• Efficient complex matrix multiplication
• Using accurate arithmetics to improve numerical reproducibility and stability in parallel applications
• Sliding-window scalar multiplication of matrices and earthquake prediction
• Reproducibility strategies for parallel preconditioned conjugate gradient
• Title not available (Why is that?)
• Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs

This page was built for publication: Reproducible and accurate matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803594)