{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T07:27:49Z","timestamp":1772350069841,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:00:00Z","timestamp":1675987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:00:00Z","timestamp":1675987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Russian Science Foundation","award":["19-11-00019"],"award-info":[{"award-number":["19-11-00019"]}]},{"name":"Russian Fund of Basic Research","award":["20-51-18009"],"award-info":[{"award-number":["20-51-18009"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11227-023-05079-5","type":"journal-article","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:06:59Z","timestamp":1676070419000},"page":"10555-10569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel implementations of randomized vector algorithm for solving large systems of linear equations"],"prefix":"10.1007","volume":"79","author":[{"given":"Karl K.","family":"Sabelfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Kireev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasiya","family":"Kireeva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"5079_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.cageo.2012.05.026","volume":"48","author":"R Tondi","year":"2012","unstructured":"Tondi R, Cavazzoni C, Danecek P, Morelli A (2012) Parallel, large, dense matrix problems: application to 3D sequential integrated inversion of seismological and gravity data. Comput Geosci 48:143\u2013156. https:\/\/doi.org\/10.1016\/j.cageo.2012.05.026","journal-title":"Comput Geosci"},{"key":"5079_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.jcp.2019.05.042","volume":"394","author":"MW Rostami","year":"2019","unstructured":"Rostami MW, Olson SD (2019) Fast algorithms for large dense matrices with applications to biofluids. J Comput Phys 394:364\u2013384","journal-title":"J Comput Phys"},{"key":"5079_CR3","doi-asserted-by":"publisher","unstructured":"Carpentieri B, Duff IS, Giraud L(2001) Robust preconditioning of dense problems from electromagnetics. In: Numerical analysis and its applications, NAA 2000, Lecture Notes in computer science 1988:170-178. https:\/\/doi.org\/10.1007\/3-540-45262-1_21","DOI":"10.1007\/3-540-45262-1_21"},{"issue":"3","key":"5079_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1080\/00207167908803174","volume":"7","author":"DJ Evans","year":"1979","unstructured":"Evans DJ, Hatzopoulos M (1979) A parallel linear system solver. Int J Comput Math 7(3):227\u2013238. https:\/\/doi.org\/10.1080\/00207167908803174","journal-title":"Int J Comput Math"},{"key":"5079_CR5","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1002\/1099-1506(200010\/12)7:7\/8<649::AID-NLA217>3.0.CO;2-W","volume":"7","author":"CW Bomhof","year":"2000","unstructured":"Bomhof CW, van der Vorst HA (2000) A parallel linear system solver for circuit simulation problems. Numer Linear Algebra Appl 7:649\u2013665. https:\/\/doi.org\/10.1002\/1099-1506(200010\/12)7:7\/8<649::AID-NLA217>3.0.CO;2-W","journal-title":"Numer Linear Algebra Appl"},{"key":"5079_CR6","doi-asserted-by":"publisher","unstructured":"Du P, Luszczek P, Dongarra J (2011) High performance dense linear system solver with soft error resilience. In: 2011 IEEE International Conference on Cluster Computing, pp 272-280. https:\/\/doi.org\/10.1109\/CLUSTER.2011.38","DOI":"10.1109\/CLUSTER.2011.38"},{"key":"5079_CR7","doi-asserted-by":"publisher","unstructured":"Marques M, Quintana-Orti G, Quintana-Orti ES, van de Geijn RA(2009) Solving large dense matrix problems on multi-core processors. In: 2009 IEEE International Symposium on Parallel and Distributed Processing, pp 1-8. https:\/\/doi.org\/10.1109\/IPDPS.2009.5161162","DOI":"10.1109\/IPDPS.2009.5161162"},{"key":"5079_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems. SIAM Press Philadelphia. https:\/\/doi.org\/10.1137\/1.9780898718003","journal-title":"SIAM Press Philadelphia"},{"key":"5079_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-52389-7_35","volume":"116","author":"YL Gurieva","year":"2017","unstructured":"Gurieva YL, Ilin VP, Perevozkin DV (2017) Deflated Krylov iterations in domain decomposition methods. Domain Decompos Methods Sci Eng XXIII Lecture Notes Comput Sci Eng 116:345\u2013352. https:\/\/doi.org\/10.1007\/978-3-319-52389-7_35","journal-title":"Domain Decompos Methods Sci Eng XXIII Lecture Notes Comput Sci Eng"},{"key":"5079_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.procs.2012.04.041","volume":"9","author":"H Ji","year":"2012","unstructured":"Ji H, Li Y (2012) Reusing random walks in Monte Carlo methods for linear systems. Procedia Comput Sci 9:383\u2013392. https:\/\/doi.org\/10.1016\/j.procs.2012.04.041","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"5079_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0908014","volume":"8","author":"VC Bhavsar","year":"1987","unstructured":"Bhavsar VC, Isaac JR (1987) Design and analysis of parallel Monte Carlo algorithms. SIAM J Sci Stat Comput 8(1):73\u201395. https:\/\/doi.org\/10.1137\/0908014","journal-title":"SIAM J Sci Stat Comput"},{"key":"5079_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1090\/S0025-5718-1950-0038138-X","volume":"4","author":"GE Forsythe","year":"1950","unstructured":"Forsythe GE, Leibler RA (1950) Matrix inversion by a Monte Carlo method. Math Comput 4:127\u2013129","journal-title":"Math Comput"},{"key":"5079_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01578388","volume":"9","author":"JH Halton","year":"1994","unstructured":"Halton JH (1994) Sequential Monte Carlo techniques for the solution of linear systems. J Sci Comput 9:213\u2013257. https:\/\/doi.org\/10.1007\/BF01578388","journal-title":"J Sci Comput"},{"key":"5079_CR14","doi-asserted-by":"publisher","unstructured":"Todorov V, Ikonomov N, Dimov I, Georgieva R (2018) A new Monte Carlo algorithm for linear algebraic systems based on the \u201cWalk on Equations\u201d algorithm. In: Proceedings of the Federated Conference on Computer Science and Information Systems, pp 257-260. https:\/\/doi.org\/10.15439\/2018F121","DOI":"10.15439\/2018F121"},{"key":"5079_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.2307\/2002546","volume":"6","author":"W Wasow","year":"1952","unstructured":"Wasow W (1952) A note on the inversion of matrices by random walks. Math Tables Aids Other Comput 6:78\u201381","journal-title":"Math Tables Aids Other Comput"},{"key":"5079_CR16","doi-asserted-by":"crossref","unstructured":"Tan C J K (2002) Antithetic Monte Carlo linear solver. In: Proceedings of the International Conference on Computational Science, Springer-Verlag, London, pp 383-392","DOI":"10.1007\/3-540-46080-2_40"},{"issue":"4","key":"5079_CR17","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.1137\/130904867","volume":"51","author":"H Ji","year":"2013","unstructured":"Ji H, Mascagni M, Li Y (2013) Convergence analysis of Markov chain Monte Carlo linear solvers using Ulam-von Neumann algorithm. SIAM J Numer Anal 51(4):2107\u20132122. https:\/\/doi.org\/10.1137\/130904867","journal-title":"SIAM J Numer Anal"},{"issue":"3","key":"5079_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2088","volume":"24","author":"M Benzi","year":"2017","unstructured":"Benzi M, Evans TM, Hamilton SP, Lupo Pasini M, Slattery SR (2017) Analysis of monte carlo accelerated iterative methods for sparse linear systems. Numer Linear Algebra Appl 24(3):e2088. https:\/\/doi.org\/10.1002\/nla.2088","journal-title":"Numer Linear Algebra Appl"},{"key":"5079_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0378-4754(00)00243-3","volume":"55","author":"I Dimov","year":"2001","unstructured":"Dimov I, Alexandrov V, Karaivanova A (2001) Parallel resolvent Monte Carlo algorithms for linear algebra problems. Math Comput Simul 55:25\u201335. https:\/\/doi.org\/10.1016\/S0378-4754(00)00243-3","journal-title":"Math Comput Simul"},{"key":"5079_CR20","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.future.2021.09.014","volume":"127","author":"F Magalh\u00e3es","year":"2022","unstructured":"Magalh\u00e3es F, Monteiro J, Acebr\u00f3n JA, Herrero JR (2022) A distributed Monte Carlo based linear algebra solver applied to the analysis of large complex networks. Future Gener Comput Syst 127:320\u2013330. https:\/\/doi.org\/10.1016\/j.future.2021.09.014","journal-title":"Future Gener Comput Syst"},{"key":"5079_CR21","doi-asserted-by":"publisher","unstructured":"Jakovits P, Kromonov I, Srirama S N (2011) Monte Carlo linear system solver using mapreduce. In: 2011 Fourth IEEE International Conference on Utility and Cloud Computing, Melbourne, VIC, Australia, pp 293-299. https:\/\/doi.org\/10.1109\/UCC.2011.47","DOI":"10.1109\/UCC.2011.47"},{"issue":"3","key":"5079_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1515\/mcma-2016-0112","volume":"22","author":"KK Sabelfeld","year":"2016","unstructured":"Sabelfeld KK (2016) Vector Monte Carlo stochastic matrix-based algorithms for large linear systems. Monte Carlo Methods Appl 22(3):259\u2013264. https:\/\/doi.org\/10.1515\/mcma-2016-0112","journal-title":"Monte Carlo Methods Appl"},{"issue":"8","key":"5079_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1049\/el:19740097","volume":"10","author":"AJ Walker","year":"1974","unstructured":"Walker AJ (1974) New fast method for generating discrete random numbers with arbitrary frequency distributions. Electr Lett 10(8):127\u2013128. https:\/\/doi.org\/10.1049\/el:19740097","journal-title":"Electr Lett"},{"issue":"3","key":"5079_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/ijoc.1030.0063","volume":"17","author":"JC Smith","year":"2005","unstructured":"Smith JC, Jacobson SH (2005) An analysis of the Alias method for discrete random-variate generation. INFORMS J Comput 17(3):321\u2013327. https:\/\/doi.org\/10.1287\/ijoc.1030.0063","journal-title":"INFORMS J Comput"},{"key":"5079_CR25","volume-title":"Matrix Theory","author":"FR Gantmacher","year":"1959","unstructured":"Gantmacher FR (1959) Matrix Theory. Chelsea publishing, New York"},{"issue":"148","key":"5079_CR26","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1287\/ijoc.1030.0063","volume":"33","author":"DP O\u2019Leary","year":"1979","unstructured":"O\u2019Leary DP, Stewart GW, Vandergraft JS (1979) Estimating the largest Eigenvalue of a positive definite matrix. Math Comput 33(148):1289\u20131292. https:\/\/doi.org\/10.1287\/ijoc.1030.0063","journal-title":"Math Comput"},{"issue":"3","key":"5079_CR27","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/1032082","volume":"32","author":"BD Flury","year":"1990","unstructured":"Flury BD (1990) Acceptance\u2013rejection sampling made easy. SIAM Rev 32(3):474\u2013476. https:\/\/doi.org\/10.1137\/1032082","journal-title":"SIAM Rev"},{"key":"5079_CR28","unstructured":"The Siberian Supercomputer Center of the Siberian Branch of the Russian Academy of Sciences. http:\/\/www.sscc.icmmg.nsc.ru. Accessed 27 July (2022)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05079-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T08:25:59Z","timestamp":1684311959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05079-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,10]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5079"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05079-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,10]]},"assertion":[{"value":"21 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors. The results\/data\/figures in this manuscript have not been published elsewhere, nor are they under consideration by another publisher.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Consent to participate was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Consent to participate was obtained from all individual participants included in the study.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}