{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:06:11Z","timestamp":1725660371353},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_23","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T19:58:14Z","timestamp":1329335894000},"page":"226-236","source":"Crossref","is-referenced-by-count":5,"title":["Fine Granularity Sparse QR Factorization for Multicore Based Systems"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Buttari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-70734-4_16","volume-title":"Applied Parallel Computing. New Paradigms for HPC in Industry and Academia","author":"P.R. Amestoy","year":"2001","unstructured":"Amestoy, P.R., Duff, I.S., L\u2019Excellent, J.-Y., Koster, J.: MUMPS: A General Purpose Distributed Memory Sparse Solver. In: S\u00f8revik, T., Manne, F., Moe, R., Gebremedhin, A.H. (eds.) PARA 2000. LNCS, vol.\u00a01947, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/(SICI)1099-1506(199607\/08)3:4<275::AID-NLA83>3.0.CO;2-7","volume":"3","author":"P.R. Amestoy","year":"1996","unstructured":"Amestoy, P.R., Duff, I.S., Puglisi, C.: Multifrontal QR factorization in a multiprocessor environment. Int. Journal of Num. Linear Alg. and Appl.\u00a03(4), 275\u2013300 (1996)","journal-title":"Int. Journal of Num. Linear Alg. and Appl."},{"key":"23_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical methods for Least Squares Problems","author":"\u00c5. Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.parco.2008.10.002","volume":"35","author":"A. Buttari","year":"2009","unstructured":"Buttari, A., Langou, J., Kurzak, J., Dongarra, J.: A class of parallel tiled linear algebra algorithms for multicore architectures. Parallel Comput.\u00a035(1), 38\u201353 (2009)","journal-title":"Parallel Comput."},{"key":"23_CR5","unstructured":"Davis, T.A.: University of Florida sparse matrix collection (2002), \n                      \n                        http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/992200.992206","volume":"30","author":"T.A. Davis","year":"2004","unstructured":"Davis, T.A.: Algorithm 832: UMFPACK V4.3 \u2014 an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw.\u00a030(2), 196\u2013199 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"23_CR7","unstructured":"Davis, T.A.: Multifrontal multithreaded rank-revealing sparse QR factorization. Accepted for Publication on ACM Transactions on Mathematical Software (2009)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw.\u00a09, 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0024-3795(87)90111-X","volume":"88\/89","author":"A. George","year":"1987","unstructured":"George, A., Liu, J.W.H.: Householder reflections versus Givens rotations in sparse orthogonal decomposition. Linear Algebra and its Applications\u00a088\/89, 223\u2013238 (1987)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0024-3795(80)90159-7","volume":"34","author":"J.A. George","year":"1980","unstructured":"George, J.A., Heath, M.T.: Solution of sparse linear least squares problems using Givens rotations. Linear Algebra and its Applications\u00a034, 69\u201383 (1980)","journal-title":"Linear Algebra and its Applications"},{"key":"23_CR11","unstructured":"Hogg, J., Reid, J.K., Scott, J.A.: A DAG-based sparse Cholesky solver for multicore architectures. Technical Report RAL-TR-2009-004, Rutherford Appleton Laboratory (2009)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0907081","volume":"7","author":"J.W.H. Liu","year":"1986","unstructured":"Liu, J.W.H.: On general row merging schemes for sparse Givens transformations. SIAM J. Sci. Stat. Comput.\u00a07, 1190\u20131211 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications\u00a011, 134\u2013172 (1990)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"23_CR14","unstructured":"Matstoms, P.: Parallel sparse QR factorization on shared memory architectures. Technical Report LiTH-MAT-R-1993-18, Department of Mathematics (1993)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: PARVEC workshop on very large least squares problems and supercomputers. Technical Report CSD-TR 464, Purdue University, IN (1983)","DOI":"10.21236\/ADA151270"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0910005","volume":"10","author":"R. Schreiber","year":"1989","unstructured":"Schreiber, R., Van Loan, C.: A storage-efficient WY representation for products of Householder transformations. SIAM J. Sci. Stat. Comput.\u00a010, 52\u201357 (1989)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"23_CR17","first-page":"1","volume":"1","author":"J. Silc","year":"1998","unstructured":"Silc, J., Robic, B., Ungerer, T.: Asynchrony in parallel computing: From dataflow to multithreading. Journal of Parallel and Distributed Computing Practices\u00a01, 1\u201333 (1998)","journal-title":"Journal of Parallel and Distributed Computing Practices"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T21:33:54Z","timestamp":1556400834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28145-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642281440","9783642281457"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28145-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}