{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:06:08Z","timestamp":1725660368167},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642281440"},{"type":"electronic","value":"9783642281457"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28145-7_27","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T14:58:14Z","timestamp":1329317894000},"page":"269-279","source":"Crossref","is-referenced-by-count":1,"title":["Cache-Oblivious Algorithms and Matrix Formats for Computations on Interval Matrices"],"prefix":"10.1007","author":[{"given":"Rafa\u0142","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Bart\u0142omiej Jacek","family":"Kubica","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"C-XSC interval library, \n                      \n                        http:\/\/www.xsc.de"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013231 (1999)","DOI":"10.1145\/305619.305645"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/383738.383741","volume":"27","author":"B.S. Andersen","year":"2001","unstructured":"Andersen, B.S., Wasniewski, J., Gustavson, F.G.: A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Trans. Math. Soft.\u00a027, 214\u2013244 (2001)","journal-title":"ACM Trans. Math. Soft."},{"key":"27_CR4","unstructured":"Dabrowski, R.J.: Cache-oblivious representations of interval matrices. Master\u2019s thesis, Warsaw University of Technology (2009) (in polish)"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0036144503428693","volume":"46","author":"E. Elmroth","year":"2004","unstructured":"Elmroth, E., Gustavson, F., Jonsson, I., K\u00e5gstr\u00f6m, B.: Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review\u00a046(1), 3\u201345 (2004)","journal-title":"SIAM Review"},{"key":"27_CR6","unstructured":"Goualard, F.: Fast and correct SIMD algorithms for interval arithmetic. In: PARA 2010 Proceedings. Accepted for publication in LNCS (2010)"},{"issue":"6","key":"27_CR7","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1147\/rd.416.0737","volume":"41","author":"F.G. Gustavson","year":"1997","unstructured":"Gustavson, F.G.: Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Res. Develop.\u00a041(6), 737\u2013755 (1997)","journal-title":"IBM Journal of Res. Develop."},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0095337","volume-title":"Applied Parallel Computing. Large Scale Scientific and Industrial Problems","author":"F. Gustavson","year":"1998","unstructured":"Gustavson, F., Henriksson, A., Jonsson, I., K\u00e5gstr\u00f6m, B., Ling, P.: Recursive Blocked Data Formats and BLAS\u2019s for Dense Linear Algebra Algorithms. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Wa\u015bniewski, J., Dongarra, J. (eds.) PARA 1998. LNCS, vol.\u00a01541, pp. 195\u2013206. Springer, Heidelberg (1998)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-540-75755-9_69","volume-title":"Applied Parallel Computing. State of the Art in Scientific Computing","author":"F.G. Gustavson","year":"2007","unstructured":"Gustavson, F.G., Wa\u015bniewski, J.: Rectangular Full Packed Format for LAPACK Algorithms Timings on Several Computers. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Dongarra, J., Wa\u015bniewski, J. (eds.) PARA 2006. LNCS, vol.\u00a04699, pp. 570\u2013579. Springer, Heidelberg (2007)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Gustavson, F.G., Wasniewski, J., Dongarra, J.J., Langou, J.: Rectangular full packed format for Cholesky\u2019s algorithm: factorization, solution, and inversion. ACM Trans. Math. Soft.\u00a037(2), article no. 18 (2010)","DOI":"10.1145\/1731022.1731028"},{"key":"27_CR11","volume-title":"Global Optimization Using Interval Analysis","author":"E. Hansen","year":"2004","unstructured":"Hansen, E., Walster, W.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (2004)"},{"key":"27_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"R.B. Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00607-010-0131-y","volume":"91","author":"U. Kulisch","year":"2011","unstructured":"Kulisch, U.: Very fast and exact accumulation of products. Computing\u00a091, 397\u2013405 (2011)","journal-title":"Computing"},{"key":"27_CR14","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"27_CR15","series-title":"LNCS","first-page":"179","volume-title":"PARA 2010, Part II","author":"H.D. Nguyen","year":"2012","unstructured":"Nguyen, H.D.: Efficient Implementation of Interval Matrix Multiplication. In: J\u00f3nasson, K. (ed.) PARA 2010, Part II. LNCS, vol.\u00a07134, pp. 179\u2013188. Springer, Heidelberg (2012)"},{"key":"27_CR16","unstructured":"Kn\u00fcppel, O.: Profil\/BIAS v 2.0. Technical report, Technische Universit\u00e4t Hamburg-Harburg (1999)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1137\/030601818","volume":"26","author":"T. Ogita","year":"2005","unstructured":"Ogita, T., Rump, S.M., Oishi, S.: Accurate sum and dot product. SIAM Journal on Scientific Computing\u00a026, 1955\u20131988 (2005)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"27_CR18","unstructured":"Pryce, J. D. (ed.): P1788, IEEE Standard for Interval Arithmetic, \n                      \n                        http:\/\/grouper.ieee.org\/groups\/1788\/email\/pdfOWdtH2mOd9.pdf"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1023\/A:1022374804152","volume":"39","author":"S.M. Rump","year":"1999","unstructured":"Rump, S.M.: Fast and parallel interval arithmetic. BIT\u00a039(3), 534\u2013544 (1999)","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel and Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28145-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:16:42Z","timestamp":1556385402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28145-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642281440","9783642281457"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28145-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}