{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:42:56Z","timestamp":1648744976773},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf02243396","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T21:19:02Z","timestamp":1132003142000},"page":"51-63","source":"Crossref","is-referenced-by-count":0,"title":["An efficient implementation of certain iterative refinement preconditioners"],"prefix":"10.1007","volume":"52","author":[{"given":"S.","family":"Petrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02243396_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01396750","volume":"51","author":"O. Axelsson","year":"1987","unstructured":"Axelsson, O.: A generalized conjugate gradient, least square method. Numer. Math.51, 209\u2013227 (1987).","journal-title":"Numer. Math."},{"key":"BF02243396_CR2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/cnm.1630040409","volume":"4","author":"O. Axelsson","year":"1988","unstructured":"Axelsson, O.: A restarted version of a generalized preconditioned conjugate gradient method. Comm. Appl. Numer. Methods4, 521\u2013530 (1988).","journal-title":"Comm. Appl. Numer. Methods"},{"key":"BF02243396_CR3","volume-title":"Finite element solution of boundary value problems. Theory and computation","author":"O. Axelsson","year":"1984","unstructured":"Axelsson, O., Barker, V. A.: Finite element solution of boundary value problems. Theory and computation. New York: Academic Press 1984."},{"key":"BF02243396_CR4","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1007\/BF01932750","volume":"29","author":"O. Axelsson","year":"1989","unstructured":"Axelsson, O., Eijkhout, V., Polman, B., Vassilevski, P.: Incomplete block-matrix factorization iterative methods for convection-diffusion problems. BIT29, 867\u2013889 (1989).","journal-title":"BIT"},{"key":"BF02243396_CR5","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0714055","volume":"14","author":"R. E. Bank","year":"1977","unstructured":"Bank, R. E., Rose, D. J.: Marching algorithm for elliptic boundary value problems. I: The constant coefficient case. SIAM J. Numer. Anal.14, 792\u2013829 (1977).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02243396_CR6","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1137\/0714064","volume":"14","author":"R. E. Bank","year":"1977","unstructured":"Bank, R. E.: Marching algorithm for elliptic boundary value problems. II: The variable coefficient case. SIAM J. Numer. Anal.14, 950\u2013970 (1977).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02243396_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0045-7825(88)90122-3","volume":"67","author":"J. H. Bramble","year":"1988","unstructured":"Bramble, J. H., Ewing, R. E., Pasciak, J. E., Schatz, A. H.: A preconditioning technique for the efficient solution of problems with local grid refinement. Comput. Meth. Appl. Mech. Eng.,67, 149\u2013159 (1988).","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"BF02243396_CR8","unstructured":"Ewing, R. E., Lazarov, R. D., Vassilevski, P. S.: Local refinement techniques for elliptic problems on cell-centered grids. II. Two grid preconditioners. E.O.R.I., Laramie, Wyoming, Report no. 1989-47, J. Numer. Lin. Alg. Appl. (to appear)."},{"key":"BF02243396_CR9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01385790","volume":"59","author":"R. E. Ewing","year":"1991","unstructured":"Ewing, R. E., Lazarov, R. D., Vassilevski, P. S.: Local refinement techniques for elliptic problems on cell-centered grids, III: Algebraic multilevel BEPS preconditioners. Numer. Math.59, 431\u2013452 (1991).","journal-title":"Numer. Math."},{"key":"BF02243396_CR10","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0080116","volume-title":"Proc. Dundee Conference on Numerical Analysis, 1975","author":"R. Fletcher","year":"1976","unstructured":"Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Proc. Dundee Conference on Numerical Analysis, 1975 (Watson, G. A., ed.), pp. 73\u201389. Berlin Heidelberg New York: Springer 1976 (Lecture Notes in Mathematics, Vol. 506)."},{"key":"BF02243396_CR11","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0914029","volume":"14","author":"R. W. Freund","year":"1993","unstructured":"Freund, R. W.: A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput.14, 470\u2013482 (1993).","journal-title":"SIAM J. Sci. Comput."},{"key":"BF02243396_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R. W. Freund","year":"1991","unstructured":"Freund, R. W., Nachtigal, N. M.: QMR a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math.60, 315\u2013359 (1991).","journal-title":"Numer. Math."},{"key":"BF02243396_CR13","series-title":"Springer Series in Computational Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02427-0","volume-title":"Multigrid methods and applications","author":"W. Hackbusch","year":"1985","unstructured":"Hackbusch, W.: Multigrid methods and applications. Berlin Heidelberg New York Tokyo: Springer 1985 (Springer Series in Computational Mathematics, Vol. 4)."},{"key":"BF02243396_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"Lanczos, C.: Solution of systems of linear equations by minimized, iterations. J. Res. Nat. Bur. Stand.49, 33\u201353 (1952).","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"BF02243396_CR15","first-page":"81","volume-title":"Iterative solution of elliptic equatons with refinement: two-level case","author":"J. Mandel","year":"1989","unstructured":"Mandel J., McCormick, S.: Iterative solution of elliptic equatons with refinement: two-level case. Domain decomposition methods (Chan, T., Glowinski, R., Periaux J., Widlund, O., eds.), pp. 81\u201392. Philadelphia: SIAM 1989."},{"issue":"Suppl.","key":"BF02243396_CR16","first-page":"115","volume":"5","author":"S. McCormick","year":"1984","unstructured":"McCormick, S.: Fast adaptive composite grid (FAC) methods: theory of the variational case. Computing [Suppl.]5, 115\u2013121 (1984).","journal-title":"Computing"},{"key":"BF02243396_CR17","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0025-5718-1986-0829618-X","volume":"46","author":"S. McCormick","year":"1986","unstructured":"McCormick, S., Thomas, J.: The fast adaptive composite grid (FAC) method for elliptic equations. Math. Comp.46, 439\u2013456 (1986).","journal-title":"Math. Comp."},{"key":"BF02243396_CR18","doi-asserted-by":"crossref","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.7, 856\u2013869 (1986).","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02243396_CR19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0910004","volume":"10","author":"P. Sonneveld","year":"1989","unstructured":"Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Comput.10, 36\u201352 (1989).","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02243396_CR20","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"H. A. Vorst Van der","year":"1992","unstructured":"Van der Vorst, H. A.: Bi-CGSTAB: A fast and smoothly convergent variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput.13, 631\u2013644 (1992).","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243396.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243396\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:27:40Z","timestamp":1557876460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF02243396"],"URL":"https:\/\/doi.org\/10.1007\/bf02243396","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}