{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:50:24Z","timestamp":1725839424198},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319265193"},{"type":"electronic","value":"9783319265209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26520-9_17","type":"book-chapter","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T15:13:03Z","timestamp":1448723583000},"page":"163-171","source":"Crossref","is-referenced-by-count":5,"title":["On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations"],"prefix":"10.1007","author":[{"given":"V.","family":"Alexandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Esquivel-Flores","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ivanovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Karaivanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,29]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-48158-3_35","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"VN Alexandrov","year":"1999","unstructured":"Alexandrov, V.N., Karaivanova, A.: Parallel monte carlo algorithms for sparse SLAE using MPI. In: Margalef, T., Dongarra, J., Luque, E. (eds.) PVM\/MPI 1999. LNCS, vol. 1697, pp. 283\u2013290. Springer, Heidelberg (1999)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1019170609950","volume":"16","author":"G All\u00e8on","year":"1997","unstructured":"All\u00e8on, G., Benzi, M., Giraud, L.: Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics. Numer. Algorithm. 16(1), 1\u201315 (1997)","journal-title":"Numer. Algorithm."},{"key":"17_CR3","series-title":"LNCS","first-page":"91","volume-title":"NMA 2002","author":"EI Atanassov","year":"2003","unstructured":"Atanassov, E.I., Durchova, M.K.: Generating and testing the modified halton sequences. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 91\u201398. Springer, Heidelberg (2003)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-12535-5_54","volume-title":"Large-Scale Scientific Computing","author":"E Atanassov","year":"2010","unstructured":"Atanassov, E., Karaivanova, A., Ivanovska, S.: Tuning the generation of sobol sequence with Owen scrambling. In: Lirkov, I., Margenov, S., Wa\u015bniewski, J. (eds.) LSSC 2009. LNCS, vol. 5910, pp. 459\u2013466. Springer, Heidelberg (2010)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1137\/S1064827594271421","volume":"5","author":"M Benzi","year":"1996","unstructured":"Benzi, M., Meyer, C., Tuma, M.: A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 5, 1135\u20131149 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"17_CR6","unstructured":"Branford, S.: The parallel hybrid Monte Carlo algoritm. Master\u2019s thesis, Schools of Systems Engineering, The Univerity of Reading (2003)"},{"key":"17_CR7","unstructured":"Branford, S.: Hybrid Monte Carlo methods for linear algebra problems. Ph.D. thesis, School of Systems Engineering, The University of Reading, April 2009"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/11428862_101","volume-title":"Computational Science \u2013 ICCS 2005","author":"S Branford","year":"2005","unstructured":"Branford, S., Weihrauch, C., Alexandrov, V.N.: A sparse parallel hybrid Monte Carlo algorithm for matrix computations. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 743\u2013751. Springer, Heidelberg (2005)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002804","volume":"7","author":"R Caflisch","year":"1998","unstructured":"Caflisch, R.: Monte Carlo and quasi-Monte Carlo methods. Acta Numerica 7, 1\u201349 (1998)","journal-title":"Acta Numerica"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1002\/1099-1506(200010\/12)7:7\/8<667::AID-NLA218>3.0.CO;2-X","volume":"7","author":"B Carpentieri","year":"2000","unstructured":"Carpentieri, B., Duff, I., Giraud, L.: Some sparse pattern selection strategies for robust Frobenius norm minimization preconditioners in electromagnetism. Numer. Linear Algebra Appl. 7, 667\u2013685 (2000)","journal-title":"Numer. Linear Algebra Appl."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Carpentieri, B., Giraud, L., et al.: Experiments with sparse preconditioning of dense problems from electromagnetic applications. Technical report, CERFACS, Toulouse, France (2000)","DOI":"10.1007\/3-540-45262-1_21"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-46080-2_63","volume-title":"Computational Science - ICCS 2002","author":"B Fathi","year":"2002","unstructured":"Fathi, B., Liu, B., Alexandrov, V.N.: Mixed Monte Carlo parallel algorithms for matrix computation. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002, Part II. LNCS, vol. 2330, pp. 609\u2013618. Springer, Heidelberg (2002)"},{"key":"17_CR13","unstructured":"Grote, M., Hagemann, M.: Spai: sparse approximate inversepreconditioner. Spaidoc.pdf paper in the SPAI 3:1 (2006)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1023988426844","volume":"25","author":"T Huckle","year":"2003","unstructured":"Huckle, T.: Factorized sparse approximate inverses for preconditioning. J. Supercomput. 25(2), 109\u2013117 (2003)","journal-title":"J. Supercomput."},{"issue":"56","key":"17_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.parco.2009.12.007","volume":"36","author":"T Huckle","year":"2010","unstructured":"Huckle, T., Kallischko, A., Roy, A., Sedlacek, M., Weinzierl, T.: An efficient parallel implementation of the MSPAI preconditioner. Parallel Comput. 36(56), 273\u2013284 (2010). Parallel Matrix Algorithms and Applications","journal-title":"Parallel Comput."},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"58","DOI":"10.55630\/sjc.2010.4.57-72","volume":"4","author":"A Karaivanova","year":"2010","unstructured":"Karaivanova, A.: Quasi-Monte Carlo methods for some linear algebra problems. Convergence and complexity. Serdica J. Comput. 4, 58\u201372 (2010). ISSN: 1312\u20136555","journal-title":"Serdica J. Comput."},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1016\/j.procs.2014.05.143","volume":"29","author":"J Strassburg","year":"2014","unstructured":"Strassburg, J., Alexandrov, V.: Enhancing Monte Carlo preconditioning methods for matrix computations. Procedia Comput. Sci. 29, 1580\u20131589 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"17_CR19","unstructured":"http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26520-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:30:45Z","timestamp":1692145845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26520-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265193","9783319265209"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26520-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}