Advertisement
Published in:
2012 | OriginalPaper | Chapter
Cache-Oblivious Algorithms and Matrix Formats for Computations on Interval Matrices
Authors : Rafał Dabrowski, Bartłomiej Jacek Kubica
Published in: Applied Parallel and Scientific Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The paper considers the use of cache-oblivious algorithms and matrix formats for computations on interval matrices. We show how the efficient use of cache is of less importance in interval computations than in traditional floating-point ones. For interval matrices there are more important factors, like the number of rounding modes switches or the number of times we have to check if an interval contains zero or not. Yet the use of cache still plays some role.