{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:11:46Z","timestamp":1725937906483},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_18","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T14:58:14Z","timestamp":1329317894000},"page":"179-188","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Implementation of Interval Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Nguyen Hong","family":"Diep","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E. Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (1999)","edition":"3"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/B:REOM.0000032111.16328.b2","volume":"10","author":"M. Ceberio","year":"2004","unstructured":"Ceberio, M., Kreinovich, V.: Fast Multiplication of Interval Matrices (Interval Version of Strassen\u2019s Algorithm). Reliable Computing\u00a010(3), 241\u2013243 (2004)","journal-title":"Reliable Computing"},{"key":"18_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L. Jaulin","year":"2001","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, Heidelberg (2001)"},{"issue":"3\u20134","key":"18_CR4","first-page":"277","volume":"53","author":"O. Kn\u0131uppel","year":"2006","unstructured":"Kn\u0131uppel, O.: PROFIL\/BIAS\u2013A fast interval library. Computing\u00a053(3\u20134), 277\u2013287 (2006)","journal-title":"Computing"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"R.E. Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press (1990)","DOI":"10.1017\/CBO9780511526473"},{"key":"18_CR7","unstructured":"Nguyen, H.D.: Efficient implementation of interval matrix multiplication (extended version). Research report, INRIA, 04 (2010)"},{"key":"18_CR8","unstructured":"Rump, S.M.: INTLAB - INTerval LABoratory, \n                      \n                        http:\/\/www.ti3.tu-hamburg.de\/rump\/intlab"},{"issue":"3","key":"18_CR9","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\u2013554 (1999)","journal-title":"BIT"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Rump, S.M.: Computer-assisted proofs and self-validating methods. In: Einarsson, B. (ed.) Handbook on Accuracy and Reliability in Scientific Computation, ch. 10, pp. 195\u2013240. SIAM (2005)","DOI":"10.1137\/1.9780898718157.ch10"},{"issue":"2","key":"18_CR11","first-page":"101","volume":"35","author":"R.C. Whaley","year":"2005","unstructured":"Whaley, R.C., Petitet, A.: Minimizing development and maintenance costs in supporting persistently optimized BLAS. Software: Practice and Experience\u00a035(2), 101\u2013121 (2005), \n                      \n                        http:\/\/www.cs.utsa.edu\/","journal-title":"Software: Practice and Experience"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:29:09Z","timestamp":1556386149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28145-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642281440","9783642281457"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28145-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}