{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:03:41Z","timestamp":1725570221054},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401568"},{"type":"electronic","value":"9783540448426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44842-x_18","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T16:38:01Z","timestamp":1290184681000},"page":"168-177","source":"Crossref","is-referenced-by-count":3,"title":["Improved Monte Carlo Linear Solvers Through Non-diagonal Splitting"],"prefix":"10.1007","author":[{"given":"Ashok","family":"Srinivasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vkram","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/2002508","volume":"4","author":"G.E. Forsythe","year":"1950","unstructured":"Forsythe, G.E., Leibler, R.A.: Matrix inversion by a Monte Carlo method. Mathematical Tables and Other Aids to Computation 4 (1950) 127\u2013127","journal-title":"Mathematical Tables and Other Aids to Computation"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/3-540-46080-2_66","volume-title":"Monte Carlo techniques for estimating the Fiedler vector in graph applications","author":"A. Srinivasan","year":"2002","unstructured":"Srinivasan, A., Mascagni, M.: Monte Carlo techniques for estimating the Fiedler vector in graph applications. In: Lecture Notes in Computer Science-2330, Springer-Verlag (2002) 635\u2013645"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Dimov, I.T., Karaivanova, A.N.: A power method with Monte Carlo iterations. In Iliev, Kaschiev, Margenov, Sendov, Vassilevski, eds.: Recent Advances in Numerical Methods and Appl. II. World Scientific (1999) 239\u2013247","DOI":"10.1142\/9789814291071_0022"},{"key":"18_CR4","volume-title":"Scientific Computing: An introductory survey","author":"M.T. Heath","year":"1997","unstructured":"Heath, M.T.: Scientific Computing: An introductory survey. McGraw-Hill, New York (1997)"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/sapm1953321209","volume":"32","author":"J.H. Curtiss","year":"1954","unstructured":"Curtiss, J.H.: Monte Carlo methods for the iteration of linear operators. Journal of Mathematical Physics 32 (1954) 209\u2013232","journal-title":"Journal of Mathematical Physics"},{"key":"18_CR6","first-page":"191","volume-title":"Symposium on Monte Carlo methods, University of Florida, 1954","author":"J.H. Curtiss","year":"1956","unstructured":"Curtiss, J.H.: A theoretical comparison of the efficiencies of two classical methods and a Monte Carlo method for computing one component of the solution of a set of linear algebraic equations. In: Symposium on Monte Carlo methods, University of Florida, 1954, 191\u2013233, New York, John Wiley and Sons (1956)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S0305004100036227","volume":"58","author":"J.H. Halton","year":"1962","unstructured":"Halton, J.H.: Sequential Monte Carlo. Proceedings of the Cambridge Philosophical Society 58 part 1 (1962) 57\u201378","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.2307\/2002546","volume":"6","author":"W. Wasow","year":"1952","unstructured":"Wasow, W.: A note on the inversion of matrices by random walks. Mathematical Tables and Other Aids to Computation 6 (1952) 78\u201378","journal-title":"Mathematical Tables and Other Aids to Computation"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved Monte Carlo linear solvers through non-diagonal splitting. Technical Report TR-030203, Department of Computer Science, Florida State University (2003) http:\/\/www.cs.fsu.edu\/research\/reports\/TR-030203.ps .","DOI":"10.1007\/3-540-44842-X_18"},{"key":"18_CR10","volume-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Third edition. Addison-Wesley, Reading, Massachusetts (1998)","edition":"Third edition"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0022-314X(92)90107-Z","volume":"42","author":"H. Faure","year":"1992","unstructured":"Faure, H.: Good permutations for extreme discrepancy. Journal of Number Theory 42 (1992) 47\u201356","journal-title":"Journal of Number Theory"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44842-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:37:11Z","timestamp":1559806631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44842-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401568","9783540448426"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44842-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}