{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:23:08Z","timestamp":1762917788076,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:00:00Z","timestamp":1495756800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I005293","EP\/I006702\/1"],"award-info":[{"award-number":["EP\/I005293","EP\/I006702\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11075-017-0342-9","type":"journal-article","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T03:08:04Z","timestamp":1495768084000},"page":"831-866","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Performance analysis of asynchronous parallel Jacobi"],"prefix":"10.1007","volume":"77","author":[{"given":"James","family":"Hook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Dingle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,26]]},"reference":[{"key":"342_CR1","doi-asserted-by":"crossref","unstructured":"Avron, H., Druinsky, A., Gupta, A.: Revisiting asynchronous linear solvers: provable convergence rate through randomization. In: Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS \u201914, pp. 198\u2013207 (2014)","DOI":"10.1109\/IPDPS.2014.31"},{"key":"342_CR2","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Inc., Upper Saddle River, NJ (1989)"},{"issue":"1","key":"342_CR3","first-page":"97","volume":"28","author":"I Bethune","year":"2014","unstructured":"Bethune, I., Bull, J.M., Dingle, N.J., Higham, N.J.: Performance analysis of asynchronous Jacobi\u2019s method implemented in MPI, SHMEM and OpenMP. IJHPCA 28(1), 97\u2013111 (2014)","journal-title":"IJHPCA"},{"key":"342_CR4","doi-asserted-by":"crossref","unstructured":"V.D. Blondel, M. Karow, V. Protassov, F.R. Wirth: Special issue on the joint spectral radius: theory, methods and app.lications. Linear Algebra App.l. 428(10), (2008)","DOI":"10.1016\/j.laa.2008.01.016"},{"key":"342_CR5","first-page":"361","volume-title":"Parallel Processing, Volume 634 of Lecture Notes in Computer Science","author":"JM Bull","year":"1992","unstructured":"Bull, J.M., Freeman, T.L.: Numerical performance of an asynchronous Jacobi iteration Parallel Processing, Volume 634 of Lecture Notes in Computer Science, pp. 361\u2013366. Springer, Berlin, Heidelberg (1992)"},{"key":"342_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D Chazan","year":"1969","unstructured":"Chazan, D., Miranker, W.: Chaotic relaxation. Linear Algebra App.l. 2, 199\u2013222 (1969)","journal-title":"Linear Algebra App.l."},{"key":"342_CR7","unstructured":"Dingle, N.J., Knottenbelt, W.J.: Distributed solution of large Markov models using asynchronous iterations and graph partitioning. In: Proceedings of the 18th UK Performance Engineering Workshop, pp. 27\u201334 (2002)"},{"key":"342_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0024-3795(90)90206-R","volume":"130","author":"L Elsner","year":"1990","unstructured":"Elsner, L., Koltracht, I., Neumann, M.: On the convergence of asynchronous paracontractions with app.lication to tomographic reconstruction from incomplete data. Linear Algebra App.l. 130, 65\u201382 (1990)","journal-title":"Linear Algebra App.l."},{"issue":"1\u20132","key":"342_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Frommer","year":"2000","unstructured":"Frommer, A., Szyld, D.B.: On asynchronous iterations. J. Comput. App.l. Math. 123(1\u20132), 201\u2013216 (2000)","journal-title":"J. Comput. App.l. Math."},{"issue":"2","key":"342_CR10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1214\/aoms\/1177705909","volume":"31","author":"H Furstenberg","year":"1960","unstructured":"Furstenberg, H., Kesten, H.: Products of random matrices. Ann. Math. Statist. 31(2), 457\u2013469, 06 (1960)","journal-title":"Ann. Math. Statist."},{"issue":"1","key":"342_CR11","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.tcs.2004.12.025","volume":"332","author":"R Gharavi","year":"2005","unstructured":"Gharavi, R., Anantharam, V.: An Upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. Theor. Comput. Sci. 332 (1), 543\u2013557 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"342_CR12","doi-asserted-by":"crossref","unstructured":"Horn, R., Johnson, C.: Matrix analysis. Cambridge University Press (1990)","DOI":"10.1017\/CBO9780511840371"},{"key":"342_CR13","unstructured":"Sridhar, S., Liu, J., Wright, S.J.: An asynchronous parallel randomized Kaczmarz algorithm. arXiv: 1401.4780 (2014)"},{"key":"342_CR14","unstructured":"Lu, J., Tang, Y.: Distributed asynchronous algorithms for solving positive definite linear equations over dynamic networks. arXiv: 1306.0260 (2013)"},{"key":"342_CR15","unstructured":"Niu, F., Recht, B., R\u00e9, C., Wright, S.J.: Hogwild: a lock-free app.roach to parallelizing stochastic gradient descent NIPS (2011)"},{"issue":"1","key":"342_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01219774","volume":"10","author":"JN Tsitsiklis","year":"1997","unstructured":"Tsitsiklis, J.N., Blondel, V.D.: The Lyapunov exponent and joint spectral radius of pairs of matrices are hard\u2014when not impossible\u2014to compute and to app.roximate. Math. Control Signals Syst. 10(1), 31\u201340 (1997)","journal-title":"Math. Control Signals Syst."},{"key":"342_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5775-2","volume-title":"An Introduction to Ergodic Theory, Graduate texts in Mathematics","author":"P Walters","year":"1982","unstructured":"Walters, P.: An Introduction to Ergodic Theory, Graduate texts in Mathematics. Springer, New York (1982)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0342-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0342-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0342-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T19:10:35Z","timestamp":1692817835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0342-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,26]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["342"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0342-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2017,5,26]]}}}