{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T00:56:50Z","timestamp":1790643410383,"version":"4.1.0"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p>Krylov subspace methods are iterative methods for solving large, sparse linear systems and eigenvalue problems in a variety of scientific domains. On modern computer architectures, communication, or movement of data, takes much longer than the equivalent amount of computation. Classical formulations of Krylov subspace methods require data movement in each iteration, creating a performance bottleneck, and thus increasing runtime. This motivated $s$-step, or communication-avoiding, Krylov subspace methods, which only perform data movement every $O(s)$ iterations. We present new communication-avoiding Krylov subspace methods, CA-BICG and CA-BICGSTAB. We are the first to provide derivations of these methods. For both sequential and parallel implementations, our methods reduce data movement by a factor of $O(s)$ versus the classical algorithms. We implement various polynomial bases and perform convergence experiments to enable comparison with the classical algorithm. We discuss recent results in improving both numerical behavior and performance in communication-avoiding Krylov subspace methods.<\/jats:p>","DOI":"10.1137\/120881191","type":"journal-article","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T06:45:58Z","timestamp":1382942758000},"page":"S42-S61","source":"Crossref","is-referenced-by-count":40,"title":["Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods"],"prefix":"10.1137","volume":"35","author":[{"given":"Erin","family":"Carson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicholas","family":"Knight","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2013,10,28]]},"reference":[{"key":"atypb1","first-page":"54","volume-title":"Proceedings of the Fifth SIAM Workshop on Combinatorial Scientific Computing","author":"Avron H.","year":"2011"},{"key":"atypb2","volume-title":"Technical report CS-97-355, Department of Computer Science","author":"Bai Z.","year":"1997"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/14.4.563"},{"key":"atypb5","series-title":"SIAM J. Matrix Anal. Appl., submitted.","volume-title":"A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of Communication-Avoiding Krylov Subspace Methods","author":"Carson E."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"atypb7","volume-title":"Proceedings of the 18th International Conference on Parallel Architectures and Compilation Techniques","author":"Catanzaro B.","year":"2009"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(89)90045-9"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365694"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"atypb11","first-page":"1","volume":"38","author":"Davis T.","year":"2011","journal-title":"ACM Trans. Math. Software"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"atypb13","volume-title":"Technical report UCB\/EECS-2007-123, EECS Department","author":"Demmel J.","year":"2007"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-587260-7.50018-2"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002737"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896306744"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897331862"},{"key":"atypb18","volume-title":"Lawrence Livermore National Laboratory","author":"Hindmarsh A.","year":"1986"},{"key":"atypb19","unstructured":"M. Hoemmen,\n                      Communication-Avoiding Krylov Subspace Methods\n                      , Ph.D. thesis, University of California, Berkeley, 2010."},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1080\/00207169208804107"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(92)90085-C"},{"key":"atypb22","volume-title":"Technical report CS-10-102","author":"LaMielle A.","year":"2010"},{"key":"atypb23","unstructured":"M. Mohiyuddin,\n                      Tuning Hardware and Software for Multiprocessors\n                      , Ph.D. thesis, University of Califorina, Berkeley, 2012."},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654096"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.21236\/ADA561678"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0771034-2"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2010.12.009"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02017352"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/0906059"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"atypb31","unstructured":"S. Toledo,\n                      Quantitative Performance Modeling of Scientific Computations and Creating Locality in Numerical Algorithms\n                      , Ph.D. thesis, MIT, Cambridge, MA, 1995."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01171-0"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/0913035"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827599353865"},{"key":"atypb35","volume-title":"Technical report 172178","author":"Van Rosendale J.","year":"1983"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/0909010"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1002\/nla.691"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/120881191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:23:25Z","timestamp":1787325805000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/120881191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1137\/120881191"],"URL":"https:\/\/doi.org\/10.1137\/120881191","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}