{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:57:38Z","timestamp":1742957858827,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031360206"},{"type":"electronic","value":"9783031360213"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36021-3_4","type":"book-chapter","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T09:06:16Z","timestamp":1688115976000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Experimental Study of\u00a0a\u00a0Parallel Iterative Solver for\u00a0Markov Chain Modeling"],"prefix":"10.1007","author":[{"given":"Valerio","family":"Besozzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Della Bartola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8000-4906","authenticated-orcid":false,"given":"Luca","family":"Gemignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/TPDS.2021.3052091","volume":"32","author":"A Ahmadi","year":"2021","unstructured":"Ahmadi, A., Manganiello, F., Khademi, A., Smith, M.C.: A parallel Jacobi-embedded Gauss-Seidel method. IEEE Trans. Parallel Distrib. Syst. 32, 1452\u20131464 (2021)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Amodio, P., Mazzia, F.: A parallel Gauss-Seidel method for block tridiagonal linear systems. SIAM J. Sci. Comput. 16(6), 1451\u20131461 (1995). https:\/\/doi.org\/10.1137\/0916084","key":"4_CR2","DOI":"10.1137\/0916084"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., et al.: LAPACK Users\u2019 Guide. USA, third edn, SIAM, Philadelphia, Pennsylvania (1999)"},{"doi-asserted-by":"publisher","unstructured":"Benzi, M.: Localization in matrix computations: theory and applications. Presented at the (2016). https:\/\/doi.org\/10.1007\/978-3-319-49887-4_4","key":"4_CR4","DOI":"10.1007\/978-3-319-49887-4_4"},{"doi-asserted-by":"crossref","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences, Classics in Applied Mathematics, vol. 9. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1994). https:\/\/doi.org\/10.1137\/1.9781611971262","key":"4_CR5","DOI":"10.1137\/1.9781611971262"},{"doi-asserted-by":"publisher","unstructured":"Bylina, J., Bylina, B.: Merging Jacobi and Gauss-Seidel methods for solving Markov chains on computer clusters. In: 2008 International Multiconference on Computer Science and Information Technology, pp. 263\u2013268 (2008). https:\/\/doi.org\/10.1109\/IMCSIT.2008.4747250","key":"4_CR6","DOI":"10.1109\/IMCSIT.2008.4747250"},{"doi-asserted-by":"crossref","unstructured":"Dudin, S., Dudin, A., Kostyukova, O., Dudina, O.: Effective algorithm for computation of the stationary distribution of multi-dimensional level-dependent Markov chains with upper block-Hessenberg structure of the generator. J. Comput. Appl. Math. 366, 112425 (2020). https:\/\/doi.org\/10.1016\/j.cam.2019.112425","key":"4_CR7","DOI":"10.1016\/j.cam.2019.112425"},{"doi-asserted-by":"crossref","unstructured":"Fernandes, P., Plateau, B., Stewart, W.J.: Efficient descriptor-vector multiplications in stochastic automata networks. J. ACM 45(3), 381\u2013414 (1998). https:\/\/doi.org\/10.1145\/278298.278303","key":"4_CR8","DOI":"10.1145\/278298.278303"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-023-01496-y","author":"L Gemignani","year":"2023","unstructured":"Gemignani, L., Meini, B.: Relaxed fixed point iterations for matrix equations arising in Markov chain modeling. Numerical Algorithms (2023). https:\/\/doi.org\/10.1007\/s11075-023-01496-y","journal-title":"Numerical Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Gemignani, L., Poloni, F.: Comparison theorems for splittings of M-matrices in (block) Hessenberg form. BIT 62(3), 849\u2013867 (2022). https:\/\/doi.org\/10.1007\/s10543-021-00899-4","key":"4_CR10","DOI":"10.1007\/s10543-021-00899-4"},{"unstructured":"Ghadiyali, H.S.: Partial gauss-seidel approach to solve large scale linear systems, Master\u2019s thesis, Florida State University (2016). https:\/\/purl.flvc.org\/fsu\/fd\/FSU_2016SP_Ghadiyali_fsu_0071N_13280","key":"4_CR11"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0166-5316(95)00007-K","volume":"24","author":"RL Klevans","year":"1995","unstructured":"Klevans, R.L., Stewart, W.J.: From queueing networks to Markov chains: the XMARCA interface. Perform. Eval. 24(1), 23\u201345 (1995). https:\/\/doi.org\/10.1016\/0166-5316(95)00007-K","journal-title":"Perform. Eval."},{"doi-asserted-by":"crossref","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D.R., Krogh, F.T.: Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5(3), 308\u2013323 (1979). https:\/\/doi.org\/10.1145\/355841.355847","key":"4_CR13","DOI":"10.1145\/355841.355847"},{"doi-asserted-by":"crossref","unstructured":"Lu, H.: Stair matrices and their generalizations with applications to iterative methods. I. A generalization of the successive overrelaxation method. SIAM J. Numer. Anal. 37(1), 1\u201317 (1999). https:\/\/doi.org\/10.1137\/S0036142998343294","key":"4_CR14","DOI":"10.1137\/S0036142998343294"},{"doi-asserted-by":"crossref","unstructured":"Marek, I., Szyld, D.B.: Iterative and semi-iterative methods for computing stationary probability vectors of Markov operators. Math. Comp. 61(204), 719\u2013731 (1993). https:\/\/doi.org\/10.2307\/2153249","key":"4_CR15","DOI":"10.1090\/S0025-5718-1993-1192973-1"},{"doi-asserted-by":"crossref","unstructured":"Marek, I., Szyld, D.B.: Comparison of convergence of general stationary iterative methods for singular matrices. SIAM J. Matrix Anal. Appl. 24(1), 68\u201377 (2002). https:\/\/doi.org\/10.1137\/S0895479800375989","key":"4_CR16","DOI":"10.1137\/S0895479800375989"},{"doi-asserted-by":"crossref","unstructured":"Meyer, C.: Matrix analysis and applied linear algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000). https:\/\/doi.org\/10.1137\/1.9780898719512","key":"4_CR17","DOI":"10.1137\/1.9780898719512"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Neil, J., Szyld, D.B.: A block ordering method for sparse matrices. SIAM J. Sci. Statist. Comput. 11(5), 811\u2013823 (1990). https:\/\/doi.org\/10.1137\/0911048","key":"4_CR18","DOI":"10.1137\/0911048"},{"doi-asserted-by":"crossref","unstructured":"Ortega, J.M., Voigt, R.G.: Solution of partial differential equations on vector and parallel computers. SIAM Rev. 27(2), 149\u2013240 (1985). https:\/\/doi.org\/10.1137\/1027055","key":"4_CR19","DOI":"10.1137\/1027055"},{"doi-asserted-by":"crossref","unstructured":"Philippe, B., Saad, Y., Stewart, W.J.: Numerical methods in Markov chain modeling. Oper. Res. 40(6), 1156\u20131179 (1992). https:\/\/www.jstor.org\/stable\/171728","key":"4_CR20","DOI":"10.1287\/opre.40.6.1156"},{"doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, second edn. (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","key":"4_CR21","DOI":"10.1137\/1.9780898718003"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.21105\/joss.00026","volume":"1","author":"C Sanderson","year":"2016","unstructured":"Sanderson, C., Curtin, R.: Armadillo: a template-based C++ library for linear algebra. J. Open Source Softw. 1, 26 (2016)","journal-title":"J. Open Source Softw."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-96418-8_50","volume-title":"Mathematical Software - ICMS 2018","author":"C Sanderson","year":"2018","unstructured":"Sanderson, C., Curtin, R.: A user-friendly hybrid sparse matrix class in C++. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) Mathematical Software - ICMS 2018, pp. 422\u2013430. Springer International Publishing, Cham (2018)"},{"doi-asserted-by":"crossref","unstructured":"Schneider, H.: Theorems on $$M$$-splittings of a singular $$M$$-matrix which depend on graph structure. Linear Algebra Appl. 58, 407\u2013424 (1984). https:\/\/doi.org\/10.1016\/0024-3795(84)90222--2","key":"4_CR24","DOI":"10.1016\/0024-3795(84)90222-2"},{"doi-asserted-by":"crossref","unstructured":"Shang, Y.: A distributed memory parallel Gauss-Seidel algorithm for linear algebraic systems. Comput. Math. Appl. 57(8), 1369\u20131376 (2009). https:\/\/doi.org\/10.1016\/j.camwa.2009.01.034","key":"4_CR25","DOI":"10.1016\/j.camwa.2009.01.034"},{"key":"4_CR26","volume-title":"Introduction to the numerical solution of Markov chains","author":"WJ Stewart","year":"1994","unstructured":"Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press, Princeton, NJ (1994)"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11227-013-0997-5","volume":"67","author":"A Touzene","year":"2014","unstructured":"Touzene, A.: A new parallel algorithm for solving large-scale Markov chains. J. Supercomput. 67(1), 239\u2013253 (2014)","journal-title":"J. Supercomput."},{"doi-asserted-by":"crossref","unstructured":"Wallin, D., L\u00f6f, H., Hagersten, E., Holmgren, S.: Multigrid and Gauss-Seidel smoothers revisited: parallelization on chip multiprocessors. In: Egan, G.K., Muraoka, Y. (eds.) Proceedings of the 20th Annual International Conference on Supercomputing, ICS 2006, Cairns, Queensland, Australia, 28 June - 01 July 2006, pp. 145\u2013155. ACM (2006). https:\/\/doi.org\/10.1145\/1183401.1183423","key":"4_CR28","DOI":"10.1145\/1183401.1183423"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36021-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T09:06:55Z","timestamp":1688116015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36021-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360206","9783031360213"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36021-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"530","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}