{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:46Z","timestamp":1725459166085},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037406","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:15:55Z","timestamp":1138202155000},"page":"217-234","source":"Crossref","is-referenced-by-count":0,"title":["Iterative methods for unsymmetric linear systems"],"prefix":"10.1007","author":[{"given":"Henk A.","family":"Van der Vorst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"W. E. Arnoldi","year":"1951","unstructured":"W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenproblem. Quart. Appl. Math., 9:17\u201329, 1951.","journal-title":"Quart. Appl. Math."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(80)90226-8","volume":"29","author":"O. Axelsson","year":"1980","unstructured":"O. Axelsson. Conjugate gradient type methods for unsymmetric and inconsistent systems of equations. Lin. Alg. and its Appl., 29:1\u201316, 1980.","journal-title":"Lin. Alg. and its Appl."},{"issue":"4","key":"14_CR3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0612048","volume":"12","author":"O. Axelsson","year":"1991","unstructured":"O. Axelsson and P. S. Vassilevski. A black box generalized conjugate gradient solver with inner iterations and variable-step preconditioning. SIAM J. Matrix Anal. Appl., 12(4):625\u2013644, 1991.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/imanum\/14.4.563","volume":"14","author":"Z. Bai","year":"1991","unstructured":"Z. Bai, D. Hu, and L. Reichel. A Newton basis GMRES implementation. IMA J. Numer. Anal., 14:563\u2013581, 1991.","journal-title":"IMA J. Numer. Anal."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01385699","volume":"66","author":"R. E. Bank","year":"1993","unstructured":"R. E. Bank and T. F. Chan. An analysis of the composite step biconjugate gradient method. Num. Math., 66:295\u2013319, 1993.","journal-title":"Num. Math."},{"key":"14_CR6","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":"R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, PA, 1994."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1002\/nme.1620280406","volume":"28","author":"G. Brussino","year":"1989","unstructured":"G. Brussino and V. Sonnad. A comparison of direct and preconditioned iterative techniques for sparse unsymmetric systems of linear equations. Int. J. for Num. Methods in Eng., 28:801\u2013815, 1989.","journal-title":"Int. J. for Num. Methods in Eng."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0377-0427(89)90045-9","volume":"25","author":"A. T. Chronopoulos","year":"1989","unstructured":"A. T. Chronopoulos and C. W. Gear. s-Step iterative methods for symmetric linear systems. J. on Comp. and Appl. Math., 25:153\u2013168, 1989.","journal-title":"J. on Comp. and Appl. Math."},{"issue":"6","key":"14_CR9","first-page":"4","volume":"X","author":"L. Crone","year":"1993","unstructured":"L. Crone and H. van der Vorst. Communication aspects of the conjugate gradient method on distributed-memory machines. Supercomputer, X(6):4\u20139, 1993.","journal-title":"Supercomputer"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S0895479893246765","volume":"17","author":"J. Cullum","year":"1996","unstructured":"J. Cullum and A. Greenbaum. Relations between Galerkin and norm-minimizing iterative methods for solving linear systems. SIAM J. Matrix Analysis and Appl., 17:223\u2013247, 1996.","journal-title":"SIAM J. Matrix Analysis and Appl."},{"key":"14_CR11","unstructured":"E. de Sturler. A parallel variant of GMRES(m). In R. Miller, editor, Proc. of the fifth Int.Symp. on Numer. Methods in Eng., 1991."},{"key":"14_CR12","volume-title":"PhD thesis","author":"E. Sturler De","year":"1994","unstructured":"E. De Sturler. Iterative methods on distributed memory computers. PhD thesis, Delft University of Technology, Delft, the Netherlands, 1994."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0168-9274(95)00079-A","volume":"18","author":"E. Sturler De","year":"1995","unstructured":"E. De Sturler and H.A. Van der Vorst. Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers. J. Appl. Num. Math., 18:441\u2013459, 1995.","journal-title":"J. Appl. Num. Math."},{"key":"14_CR14","volume-title":"Acta Numerica 1993","author":"J. Demmel","year":"1993","unstructured":"J. Demmel, M. Heath, and H. Van der Vorst. Parallel numerical linear algebra. In Acta Numerica 1993. Cambridge University Press, Cambridge, 1993."},{"key":"14_CR15","volume-title":"Solving Linear Systems on Vector and Shared Memory Computers","author":"J. J. Dongarra","year":"1991","unstructured":"J. J. Dongarra, I. S. Duff, D. C. Sorensen, and H. A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, PA, 1991."},{"key":"14_CR16","volume-title":"PhD thesis","author":"H. C. Elman","year":"1982","unstructured":"H. C. Elman. Iterative methods for large sparse nonsymmetric systems of linear equations. PhD thesis, Yale University, New Haven, CT, 1982."},{"issue":"2","key":"14_CR17","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1137\/0721026","volume":"21","author":"V. Faber","year":"1984","unstructured":"V. Faber and T. A. Manteuffel. Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Analysis, 21(2):352\u2013362, 1984.","journal-title":"SIAM J. Numer. Analysis"},{"key":"14_CR18","first-page":"73","volume-title":"volume 506 of Lecture Notes Math.","author":"R. Fletcher","year":"1976","unstructured":"R. Fletcher. Conjugate gradient methods for indefinite systems, volume 506 of Lecture Notes Math., pages 73\u201389. Springer-Verlag, Berlin-Heidelberg-New York, 1976."},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/0914009","volume":"14","author":"R. W. Freund","year":"1993","unstructured":"R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput., 14:137\u2013158, 1993.","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR20","unstructured":"R. W. Freund and N. M. Nachtigal. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 2. Technical Report 90.46, RIACS, NASA Ames Research Center, 1990."},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R. W. Freund","year":"1991","unstructured":"R. W. Freund and N. M. Nachtigal. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Num. Math., 60:315\u2013339, 1991.","journal-title":"Num. Math."},{"key":"14_CR22","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1989","unstructured":"G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1989."},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0024-3795(80)90165-2","volume":"34","author":"K. C. Jea","year":"1980","unstructured":"K. C. Jea and D. M. Young. Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods. Lin. Algebra Appl., 34:159\u2013194, 1980.","journal-title":"Lin. Algebra Appl."},{"key":"14_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"C. Lanczos. Solution of systems of linear equations by minimized iterations. J. Res. Natl. Bur. Stand, 49:33\u201353, 1952.","journal-title":"J. Res. Natl. Bur. Stand"},{"key":"14_CR25","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0613049","volume":"13","author":"N. M. Nachtigal","year":"1992","unstructured":"N. M. Nachtigal, S. C. Reddy, and L. N. Trefethen. How fast are nonsymmetric matrix iterations? SIAM J. Matrix Anal. Appl., 13:778\u2013795, 1992.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"14_CR26","first-page":"105","volume":"44","author":"B. N. Parlett","year":"1985","unstructured":"B. N. Parlett, D. R. Taylor, and Z. A. Liu. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comp., 44:105\u2013124, 1985.","journal-title":"Math. Comp."},{"key":"14_CR27","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/125826.126135","volume-title":"Supercomputing '91","author":"C. Pommerell","year":"1991","unstructured":"C. Pommerell and W. Fichtner. PILS: An iterative linear solver package for illconditioned systems. In Supercomputing '91, pages 588\u2013599, Los Alamitos, CA., 1991. IEEE Computer Society."},{"key":"14_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-8191(89)90030-6","volume":"11","author":"G. Radicati di Brozolo","year":"1989","unstructured":"G. Radicati di Brozolo and Y. Robert. Parallel conjugate gradient-like algorithms for solving sparse non-symmetric systems on a vector multiprocessor. Parallel Computing, 11:223\u2013239, 1989.","journal-title":"Parallel Computing"},{"key":"14_CR29","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0914028","volume":"14","author":"Y. Saad","year":"1993","unstructured":"Y. Saad. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Comput., 14:461\u2013469, 1993.","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR30","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0025-5718-1985-0777273-9","volume":"44","author":"Y. Saad","year":"1985","unstructured":"Y. Saad and M. H. Schultz. Conjugate Gradient-like algorithms for solving non-symmetric linear systems. Math. of Comp., 44:417\u2013424, 1985.","journal-title":"Math. of Comp."},{"key":"14_CR31","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y. Saad","year":"1986","unstructured":"Y. Saad and M. H. Schultz. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 7:856\u2013869, 1986.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"14_CR32","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02140769","volume":"10","author":"G. L. G. Sleijpen","year":"1995","unstructured":"G. L. G. Sleijpen and H.A. Van der Vorst. Maintaining convergence properties of BICGSTAB methods in finite precision arithmetic. Numerical Algorithms, 10:203\u2013223, 1995.","journal-title":"Numerical Algorithms"},{"key":"14_CR33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02141261","volume":"7","author":"G. L. G. Sleijpen","year":"1994","unstructured":"G. L. G. Sleijpen, H.A. Van der Vorst, and D. R. Fokkema. Bi-CGSTAB(\u2113) and other hybrid Bi-CG methods. Numerical Algorithms, 7:75\u2013109, 1994.","journal-title":"Numerical Algorithms"},{"key":"14_CR34","first-page":"11","volume":"1","author":"G. L. G. Sleijpen","year":"1993","unstructured":"G. L. G. Sleijpen and D. R. Fokkema. BICGSTAB(\u2113) for linear equations involving unsymmetric matrices with complex spectrum. ETNA, 1:11\u201332, 1993.","journal-title":"ETNA"},{"key":"14_CR35","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0910004","volume":"10","author":"P. Sonneveld","year":"1989","unstructured":"P. Sonneveld. CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 10:36\u201352, 1989.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"14_CR36","volume-title":"PhD thesis","author":"K.H. Tan","year":"1995","unstructured":"K.H. Tan. Local coupling in domain decomposition. PhD thesis, Utrecht University, Utrecht, the Netherlands, 1995."},{"key":"14_CR37","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"H. A. Vorst Van der","year":"1992","unstructured":"H. A. Van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems. SIAM J. Sci. Statist. Comput., 13:631\u2013644, 1992.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"14_CR38","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/nla.1680010404","volume":"1","author":"H. A. Vorst Van der","year":"1994","unstructured":"H. A. Van der Vorst and C. Vuik. GMRESR: A family of nested GMRES methods. Num. Lin. Alg. with Appl., 1:369\u2013386, 1994.","journal-title":"Num. Lin. Alg. with Appl."},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"P. K. W. Vinsome. ORTOMIN: an iterative method for solving sparse sets of simultaneous linear equations. In Proc.Fourth Symposium on Reservoir Simulation, pages 149\u2013159. Society of Petroleum Engineers of AIME, 1976.","DOI":"10.2118\/5729-MS"},{"key":"14_CR40","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nla.1680010603","volume":"1","author":"T. Washio","year":"1994","unstructured":"T. Washio and K. Hayami. Parallel block preconditioning based on SSOR and MILU. Numer. Lin. Alg. with Applic., 1:533\u2013553, 1994.","journal-title":"Numer. Lin. Alg. with Applic."},{"key":"14_CR41","volume-title":"Iterative Solution of Large Linear Systems","author":"D. Young","year":"1971","unstructured":"D. Young. Iterative Solution of Large Linear Systems. Academic Press, New York, 1971."}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:34:33Z","timestamp":1555425273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/bfb0037406","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}