{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T16:27:14Z","timestamp":1773419234390,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540693833","type":"print"},{"value":"9783540693840","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_100","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:39:15Z","timestamp":1217471955000},"page":"955-964","source":"Crossref","is-referenced-by-count":9,"title":["On Using Reinforcement Learning to Solve Sparse Linear Systems"],"prefix":"10.1007","author":[{"given":"Erik","family":"Kuefler","sequence":"first","affiliation":[]},{"given":"Tzu-Yi","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"100_CR1","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M. Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: A survey. J. of Comp. Physics\u00a0182(2), 418\u2013477 (2002)","journal-title":"J. of Comp. Physics"},{"issue":"1-2","key":"100_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-0427(00)00412-X","volume":"123","author":"Y. Saad","year":"2000","unstructured":"Saad, Y., van der Vorst, H.A.: Iterative solution of linear systems in the 20th century. J. Comput. Appl. Math.\u00a0123(1-2), 1\u201333 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"100_CR3","unstructured":"Bhowmick, S., Eijkhout, V., Freund, Y., Fuentes, E., Keyes, D.: Application of machine learning to the selection of sparse linear solvers. International Journal of High Performance Computing Applications (submitted, 2006)"},{"key":"100_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-72584-8_39","volume-title":"Computational Science \u2013 ICCS 2007","author":"A.L. Holloway","year":"2007","unstructured":"Holloway, A.L., Chen, T.-Y.: Neural networks for predicting the behavior of preconditioned iterative solvers. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04487, pp. 302\u2013309. Springer, Heidelberg (2007)"},{"key":"100_CR5","unstructured":"Xu, S., Zhang, J.: Solvability prediction of sparse matrices with matrix structure-based preconditioners. In: Proc. Preconditioning 2005, Atlanta, Georgia (2005)"},{"key":"100_CR6","unstructured":"Xu, S., Zhang, J.: SVM classification for predicting sparse matrix solvability with parameterized matrix preconditioners. Technical Report 450-06, University of Kentucky (2006)"},{"key":"100_CR7","doi-asserted-by":"crossref","unstructured":"George, T., Sarin, V.: An approach recommender for preconditioned iterative solvers. In: Proc. Preconditioning 2007, Toulouse, France (2007)","DOI":"10.1109\/ICDM.2008.105"},{"issue":"2","key":"100_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/353474.353481","volume":"26","author":"N. Ramakrishnan","year":"2000","unstructured":"Ramakrishnan, N., Ribbens, C.J.: Mining and visualizing recommendation spaces for elliptic PDEs with continuous attributes. ACM Trans. on Math. Softw.\u00a026(2), 254\u2013273 (2000)","journal-title":"ACM Trans. on Math. Softw."},{"key":"100_CR9","volume-title":"Reinforcement Learning: An Introduction","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"key":"100_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971538","volume-title":"Templates for the solution of linear systems: Building blocks for iterative methods","author":"R. Barrett","year":"1994","unstructured":"Barrett, R., Berry, M., Chan, T.F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., van der Vorst, H.: Templates for the solution of linear systems: Building blocks for iterative methods. SIAM, Philadelphia (1994)"},{"issue":"4","key":"100_CR11","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0895479897317661","volume":"20","author":"I.S. Duff","year":"1999","unstructured":"Duff, I.S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl.\u00a020(4), 889\u2013901 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"100_CR12","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/S0895479899358443","volume":"22","author":"I.S. Duff","year":"2001","unstructured":"Duff, I.S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl.\u00a022(4), 973\u2013996 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"100_CR13","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. of the 24th Natl. Conf. of the ACM, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"issue":"3","key":"100_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"T. Davis","year":"2004","unstructured":"Davis, T., Gilbert, J., Larimore, S., Ng, E.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. on Math. Softw.\u00a030(3), 377\u2013380 (2004)","journal-title":"ACM Trans. on Math. Softw."},{"issue":"3","key":"100_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/1024074.1024079","volume":"30","author":"T. Davis","year":"2004","unstructured":"Davis, T., Gilbert, J., Larimore, S., Ng, E.: A column approximate minimum degree ordering algorithm. ACM Trans. on Math. Softw.\u00a030(3), 353\u2013376 (2004)","journal-title":"ACM Trans. on Math. Softw."},{"key":"100_CR16","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"T.-Y. Chen","year":"2004","unstructured":"Chen, T.-Y.: ILUTP_Mem: A space-efficient incomplete LU preconditioner. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03046, pp. 31\u201339. Springer, Heidelberg (2004)"},{"issue":"3","key":"100_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y. Saad","year":"1986","unstructured":"Saad, Y., Schultz, M.H.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput.\u00a07(3), 856\u2013869 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"100_CR18","unstructured":"Xu, S., Zhang, J.: A data mining approach to matrix preconditioning problem. Technical Report 433-05, University of Kentucky (2005)"},{"key":"100_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/11751595_113","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"M. Lazzareschi","year":"2006","unstructured":"Lazzareschi, M., Chen, T.-Y.: Using performance profiles to evaluate preconditioners for iterative methods. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol.\u00a03982, pp. 1081\u20131089. Springer, Heidelberg (2006)"},{"key":"100_CR20","unstructured":"Davis, T.: University of Florida sparse matrix collection. NA Digest\u00a092(42), October 16, 1994 and NA Digest 96(28) July 23, 1996, and NA Digest 97(23) June 7 (1997) http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/"},{"key":"100_CR21","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2006097","volume":"34","author":"T.A. Manteuffel","year":"1980","unstructured":"Manteuffel, T.A.: An incomplete factorization technique for positive definite linear systems. Mathematics of Computation\u00a034, 473\u2013497 (1980)","journal-title":"Mathematics of Computation"},{"key":"100_CR22","volume-title":"Sparse Distributed Memory","author":"P. Kanerva","year":"1988","unstructured":"Kanerva, P.: Sparse Distributed Memory. MIT Press, Cambridge (1988)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:59:57Z","timestamp":1557698397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}