Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C-XSC interval library, http://www.xsc.de
Chatterjee, S., Lebeck, A.R., Patnala, P.K., Thottethodi, M.: Recursive array layouts and fast parallel matrix multiplication. In: Proceedings of Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 222–231 (1999)
Andersen, B.S., Wasniewski, J., Gustavson, F.G.: A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Trans. Math. Soft. 27, 214–244 (2001)
Dabrowski, R.J.: Cache-oblivious representations of interval matrices. Master’s thesis, Warsaw University of Technology (2009) (in polish)
Elmroth, E., Gustavson, F., Jonsson, I., Kågström, B.: Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review 46(1), 3–45 (2004)
Goualard, F.: Fast and correct SIMD algorithms for interval arithmetic. In: PARA 2010 Proceedings. Accepted for publication in LNCS (2010)
Gustavson, F.G.: Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Res. Develop. 41(6), 737–755 (1997)
Gustavson, F., Henriksson, A., Jonsson, I., Kågström, B., Ling, P.: Recursive Blocked Data Formats and BLAS’s for Dense Linear Algebra Algorithms. In: Kågström, B., Elmroth, E., Waśniewski, J., Dongarra, J. (eds.) PARA 1998. LNCS, vol. 1541, pp. 195–206. Springer, Heidelberg (1998)
Gustavson, F.G., Waśniewski, J.: Rectangular Full Packed Format for LAPACK Algorithms Timings on Several Computers. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 570–579. Springer, Heidelberg (2007)
Gustavson, F.G., Wasniewski, J., Dongarra, J.J., Langou, J.: Rectangular full packed format for Cholesky’s algorithm: factorization, solution, and inversion. ACM Trans. Math. Soft. 37(2), article no. 18 (2010)
Hansen, E., Walster, W.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (2004)
Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)
Kulisch, U.: Very fast and exact accumulation of products. Computing 91, 397–405 (2011)
Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
Nguyen, H.D.: Efficient Implementation of Interval Matrix Multiplication. In: Jónasson, K. (ed.) PARA 2010, Part II. LNCS, vol. 7134, pp. 179–188. Springer, Heidelberg (2012)
Knüppel, O.: Profil/BIAS v 2.0. Technical report, Technische Universität Hamburg-Harburg (1999)
Ogita, T., Rump, S.M., Oishi, S.: Accurate sum and dot product. SIAM Journal on Scientific Computing 26, 1955–1988 (2005)
Pryce, J. D. (ed.): P1788, IEEE Standard for Interval Arithmetic, http://grouper.ieee.org/groups/1788/email/pdfOWdtH2mOd9.pdf
Rump, S.M.: Fast and parallel interval arithmetic. BIT 39(3), 534–544 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dabrowski, R., Kubica, B.J. (2012). Cache-Oblivious Algorithms and Matrix Formats for Computations on Interval Matrices. In: Jónasson, K. (eds) Applied Parallel and Scientific Computing. PARA 2010. Lecture Notes in Computer Science, vol 7134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28145-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-28145-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28144-0
Online ISBN: 978-3-642-28145-7
eBook Packages: Computer ScienceComputer Science (R0)