{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:29:07Z","timestamp":1742970547142,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038582"},{"type":"electronic","value":"9783319038599"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03859-9_19","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:54:34Z","timestamp":1386593674000},"page":"226-235","source":"Crossref","is-referenced-by-count":0,"title":["Synchronization-Reducing Variants of the Biconjugate Gradient and the Quasi-Minimal Residual Methods"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Feuerriegel","sequence":"first","affiliation":[]},{"given":"H. Martin","family":"B\u00fccker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"LNM","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0080116","volume-title":"Numerical Analysis","author":"R. Fletcher","year":"1976","unstructured":"Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G. (ed.) Numerical Analysis. LNM, vol.\u00a0506, pp. 73\u201389. Springer, Heidelberg (1976)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/0915022","volume":"15","author":"R.W. Freund","year":"1994","unstructured":"Freund, R.W., Nachtigal, N.M.: An implementation of the QMR method based on coupled two-term recurrences. SIAM J. Sci. Comput.\u00a015(2), 313\u2013337 (1994)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1137\/0910073","volume":"10","author":"Y. Saad","year":"1989","unstructured":"Saad, Y.: Krylov subspace methods on supercomputers. SIAM J. Sci. Stat. Comput.\u00a010(6), 1200\u20131232 (1989)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0309-1708(90)90005-O","volume":"13","author":"H. van der Vorst","year":"1990","unstructured":"van der Vorst, H.: Iterative methods for the solution of large systems of equations on supercomputers. Advances in Water Resources\u00a013(3), 137\u2013146 (1990)","journal-title":"Advances in Water Resources"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1017\/S096249290000235X","volume":"2","author":"J. Demmel","year":"1993","unstructured":"Demmel, J., Heath, M., van der Vorst, H.: Parallel numerical linear algebra. Acta Numerica\u00a02(1), 111\u2013197 (1993)","journal-title":"Acta Numerica"},{"issue":"13-14","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1016\/S0167-8191(99)00077-0","volume":"25","author":"I.S. Duff","year":"1999","unstructured":"Duff, I.S., van der Vorst, H.A.: Developments and trends in the parallel solution of linear systems. Parallel Computing\u00a025(13-14), 1931\u20131970 (1999)","journal-title":"Parallel Computing"},{"key":"19_CR7","first-page":"521","volume":"10","author":"H.M. B\u00fccker","year":"2002","unstructured":"B\u00fccker, H.M.: Iteratively solving large sparse linear systems on parallel computers. NIC Serices, John Von Neumann Institute f. Computing. J\u00fclich\u00a010, 521\u2013548 (2002)","journal-title":"J\u00fclich"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-1-4615-5205-5_5","volume-title":"Parallel numerical computations with applications","author":"H.M. B\u00fccker","year":"1999","unstructured":"B\u00fccker, H.M., Sauren, M.: Reducing global synchronization in the biconjugate gradient method. In: Yang, T. (ed.) Parallel numerical computations with applications, pp. 63\u201376. Kluwer Academic Publishers, Norwell (1999)"},{"key":"19_CR9","unstructured":"Fischer, B., Freund, R.: An inner product-free conjugate gradient-like algorithm for Hermitian positive definite systems. In: Brown, J., et al. (eds.) Proc. Cornelius Lanczos Intern. Centenary Conf., pp. 288\u2013290. SIAM (1994)"},{"key":"19_CR10","first-page":"9","volume":"13","author":"G. Meurant","year":"1986","unstructured":"Meurant, G.: The conjugate gradient method on supercomputers. Supercomputer\u00a013, 9\u201317 (1986)","journal-title":"Supercomputer"},{"key":"19_CR11","unstructured":"Van Rosendale, J.: Minimizing inner product data dependencies in conjugate gradient iteration. NASA Contractor Report NASA\u2013CR\u2013172178, NASA Langley Research Center, Center, Hampton, VA (1983)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63138-0_7","volume-title":"Solving Irregularly Structured Problems in Parallel","author":"H.M. B\u00fccker","year":"1997","unstructured":"B\u00fccker, H.M., Sauren, M.: A Variant of the Biconjugate Gradient Method Suitable for Massively Parallel Computing. In: Bilardi, G., Ferreira, A., L\u00fcling, R., Rolim, J. (eds.) IRREGULAR 1997. LNCS, vol.\u00a01253, pp. 72\u201379. Springer, Heidelberg (1997)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-62095-8_17","volume-title":"Applied Parallel Computing. Industrial Computation and Optimization","author":"H.M. B\u00fccker","year":"1996","unstructured":"B\u00fccker, H.M., Sauren, M.: A Parallel Version of the Quasi-Minimal Residual Method Based on Coupled Two-Term Recurrences. In: Wa\u015bniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds.) PARA 1996. LNCS, vol.\u00a01184, pp. 157\u2013165. Springer, Heidelberg (1996)"},{"key":"19_CR14","unstructured":"Chronopoulos, A.T.: A Class of Parallel Iterative Methods Implemented on Multiprocessors. Technical report UIUCDCS\u2013R\u201386\u20131267, Department of Computer Science, University of Illinois, Urbana, Illinois (1986)"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0377-0427(89)90045-9","volume":"25","author":"A.T. Chronopoulos","year":"1989","unstructured":"Chronopoulos, A.T., Gear, C.W.: S-step iterative methods for symmetric linear systems. J. Comput. Appl. Math.\u00a025(2), 153\u2013168 (1989)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"19_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/0167-8191(96)00022-1","volume":"22","author":"A.T. Chronopoulos","year":"1996","unstructured":"Chronopoulos, A.T., Swanson, C.D.: Parallel iterative s-step methods for unsymmetric linear systems. Parallel Computing\u00a022(5), 623\u2013641 (1996)","journal-title":"Parallel Computing"},{"issue":"6-7","key":"19_CR17","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/S0167-8191(05)80065-1","volume":"17","author":"S.K. Kim","year":"1991","unstructured":"Kim, S.K., Chronopoulos, A.: A class of Lanczos-like algorithms implemented on parallel computers. Parallel Computing\u00a017(6-7), 763\u2013778 (1991)","journal-title":"Parallel Computing"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0377-0427(92)90085-C","volume":"42","author":"S.K. Kim","year":"1992","unstructured":"Kim, S.K., Chronopoulos, A.T.: An efficient nonsymmetric Lanczos method on parallel vector computers. J. Comput. Appl. Math.\u00a042(3), 357\u2013374 (1992)","journal-title":"J. Comput. Appl. Math."},{"issue":"12","key":"19_CR19","doi-asserted-by":"publisher","first-page":"2938","DOI":"10.1016\/j.cam.2012.01.028","volume":"236","author":"J.A. Alvarez-Dios","year":"2012","unstructured":"Alvarez-Dios, J.A., Cabaleiro, J.C., Casal, G.: A generalization of s-step variants of gradient methods. J. Comput. Appl. Math.\u00a0236(12), 2938\u20132953 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Mohiyuddin, M., Hoemmen, M., Demmel, J., Yelick, K.: Minimizing communication in sparse matrix solvers. In: Proc. Conf. High Perf. Comput. Networking, Storage and Analysis, SC 2009, pp. 36:1\u201336:12. ACM, New York (2009)","DOI":"10.1145\/1654059.1654096"},{"key":"19_CR21","unstructured":"Hoemmen, M.F.: Communication-avoiding Krylov subspace methods. PhD thesis, EECS Department, University of California, Berkeley (2010)"},{"issue":"5","key":"19_CR22","doi-asserted-by":"crossref","first-page":"S42","DOI":"10.1137\/120881191","volume":"35","author":"E. Carson","year":"2013","unstructured":"Carson, E., Knight, N., Demmel, J.: Avoiding communication in two-sided Krylov subspace methods. SIAM J. Sci. Comput.\u00a035(5), S42\u2013S61 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/12086563X","volume":"35","author":"P. Ghysels","year":"2013","unstructured":"Ghysels, P., Ashby, T.J., Meerbergen, K., Vanroose, W.: Hiding global communication latency in the GMRES algorithm on massively parallel machines. SIAM J. Sci. Comput.\u00a035(1), 48\u201371 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Ghysels, P., Vanroose, W.: Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm. Parallel Computing (in press, 2013)","DOI":"10.1016\/j.parco.2013.06.001"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Curfmann McInnes, L., Smith, B., Zhang, H., Mills, R.T.: Hierarchical and nested Krylov methods for extreme-scale computing. Parallel Computing (in press, 2013)","DOI":"10.1016\/j.parco.2013.10.001"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C. Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand.\u00a045(4), 255\u2013282 (1950)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Feuerriegel, S., B\u00fccker, H.M.: A normalization scheme for the non-symmetric s-Step Lanczos algorithm. In: Ko\u0142odziej, J., Aversa, R., Zhang, J., Amato, F., Fortino, G. (eds.) ICA3PP 2013, Part II. LNCS, vol.\u00a08286, pp. 30\u201339. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-319-03889-6_4"},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R. Freund","year":"1991","unstructured":"Freund, R., Nachtigal, N.: QMR: a quasi-minimal residual method for non-Hermitian linear systems. Num. Math.\u00a060(1), 315\u2013339 (1991)","journal-title":"Num. Math."},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/S0036144596319368","volume":"40","author":"M. Sauren","year":"1998","unstructured":"Sauren, M., B\u00fccker, H.M.: On deriving the quasi-minimal residual method. SIAM Review\u00a040(4), 922\u2013926 (1998)","journal-title":"SIAM Review"},{"issue":"3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/S1064827599353865","volume":"22","author":"H.A. van der Vorst","year":"2000","unstructured":"van der Vorst, H.A., Ye, Q.: Residual replacement strategies for Krylov subspace iterative methods for the convergence of true residuals. SIAM J. Sci. Comput.\u00a022(3), 835\u2013852 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Carson, E., Demmel, J.: A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods. Technical Report UCB\/EECS\u20132012\u2013197, University of California, Berkeley (2012)","DOI":"10.21236\/ADA561766"},{"key":"19_CR32","unstructured":"Gustafsson, M., Demmel, J., Holmgren, S.: Numerical evaluation of the communication-avoiding Lanczos algorithm. Technical Report 2012\u2013001, Department of Information Technology, Uppsala University (January 2012)"},{"key":"19_CR33","first-page":"720","volume-title":"IMACS 1991 Proc. 13th World Congress Comput. Appl. Math","author":"R.W. Freund","year":"1991","unstructured":"Freund, R.W., Hochbruck, M.: A biconjugate gradient type algorithm on massively parallel architectures. In: Vichnevetsky, R., Miller, J.J.H. (eds.) IMACS 1991 Proc. 13th World Congress Comput. Appl. Math, pp. 720\u2013721. Criterion Press, Dublin (1991)"},{"key":"19_CR34","unstructured":"Freund, R.W., Hochbruck, M.: A biconjugate gradient-type algorithm for the iterative solution of non-Hermitian linear systems on massively parallel architectures. In: Brezinski, C., Kulisch, U. (eds.) IMACS 1991, Proc. 13th World Congress Comput. Appl. Math.\u00a0I, pp. 169\u2013178. Elsevier Science Publishers (1992)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03859-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T03:20:39Z","timestamp":1674530439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03859-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038582","9783319038599"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03859-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}