{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:32:28Z","timestamp":1776828748793,"version":"3.51.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Computational Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1018974514896","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"169-186","source":"Crossref","is-referenced-by-count":42,"title":["A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations"],"prefix":"10.1007","volume":"10","author":[{"given":"Zhong\u2010Zhi","family":"Bai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"325328_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF01932955","volume":"12","author":"O. Axelsson","year":"1972","unstructured":"O. Axelsson, A generalized SSOR method, BIT 12 (1972) 443-467.","journal-title":"BIT"},{"key":"325328_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-0427(85)90004-4","volume":"12\/13","author":"O. Axelsson","year":"1985","unstructured":"O. Axelsson, Incomplete block matrix factorization preconditioning methods. The ultimate answer?, J. Comput. Appl. Math. 12\/13 (1985) 3-18.","journal-title":"J. Comput. Appl. Math."},{"key":"325328_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624100","volume-title":"Iterative Solution Methods","author":"O. Axelsson","year":"1994","unstructured":"O. Axelsson, Iterative Solution Methods (Cambridge University Press, Cambridge, 1994)."},{"key":"325328_CR4","volume-title":"Finite Element Solution of Boundary Value Problems: Theory and Computation","author":"O. Axelsson","year":"1984","unstructured":"O. Axelsson and V.A. Barker, Finite Element Solution of Boundary Value Problems: Theory and Computation (Academic Press, New York, 1984)."},{"key":"325328_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0024-3795(86)90159-X","volume":"77","author":"O. Axelsson","year":"1986","unstructured":"O. Axelsson and B. Polman, On approximate factorization methods for block matrices suitable for vector and parallel processors, Linear Algebra Appl. 77 (1986) 3-26.","journal-title":"Linear Algebra Appl."},{"key":"325328_CR6","unstructured":"Z.-Z. Bai, The modified block SSOR preconditioners for symmetric positive definite linear systems, to appear (1997)."},{"key":"325328_CR7","doi-asserted-by":"crossref","unstructured":"R.E. Bank and T.F. Dupont, Analysis of a two-level scheme for solving finite element equations, Report CNA-159, Center for Numerical Analysis, University of Texas at Austin (1980).","DOI":"10.2523\/7683-MS"},{"key":"325328_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/2007724","volume":"36","author":"R.E. Bank","year":"1981","unstructured":"R.E. Bank and T.F. Dupont, An optimal order process for solving finite element equations, Math. Comp. 36 (1981) 35-51.","journal-title":"Math. Comp."},{"key":"325328_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01462238","volume":"52","author":"R.E. Bank","year":"1988","unstructured":"R.E. Bank, T.F. Dupont and H. Yserentant, The hierarchical basis multigrid method, Numer. Math. 52 (1988) 427-458.","journal-title":"Numer. Math."},{"key":"325328_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01400317","volume":"37","author":"D. Braess","year":"1981","unstructured":"D. Braess, The contraction number of a multigrid method for solving Poisson equation, Numer. Math. 37 (1981) 387-404.","journal-title":"Numer. Math."},{"key":"325328_CR11","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1137\/0906018","volume":"6","author":"C. Concus","year":"1985","unstructured":"C. Concus, G.H. Golub and G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput. 6 (1985) 220-252.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"325328_CR12","volume-title":"Matrix Computation","author":"G.H. Golub","year":"1996","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computation, 3rd ed. (Johns Hopkins University Press, Baltimore, MD, 1996).","edition":"3rd ed."},{"key":"325328_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01931691","volume":"18","author":"I. Gustafsson","year":"1978","unstructured":"I. Gustafsson, A class of first order factorization methods, BIT 18 (1978) 142-156.","journal-title":"BIT"},{"key":"325328_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02427-0","volume-title":"Multigrid Methods and Applications","author":"W. Hackbusch","year":"1985","unstructured":"W. Hackbusch, Multigrid Methods and Applications (Springer, Berlin, 1985)."},{"key":"325328_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2307\/2006264","volume":"32","author":"A. Hadjidimos","year":"1978","unstructured":"A. Hadjidimos, Accelerated overrelaxation method, Math. Comp. 32 (1978) 149-157.","journal-title":"Math. Comp."},{"key":"325328_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1080\/00207168308803395","volume":"14","author":"A. Hadjidimos","year":"1983","unstructured":"A. Hadjidimos, On the generalization of the basic iterative methods for the solution of the linear systems, Internat. J. Comput. Math. 14 (1983) 355-369.","journal-title":"Internat. J. Comput. Math."},{"key":"325328_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0024-3795(86)90184-9","volume":"75","author":"A. Hadjidimos","year":"1986","unstructured":"A. Hadjidimos, A. Psimarni and A. Yeyios, On the convergence of some generalized iterative methods, Linear Algebra Appl. 75 (1986) 117-132.","journal-title":"Linear Algebra Appl."},{"key":"325328_CR18","volume-title":"Applied Iterative Methods","author":"L.A. Hageman","year":"1981","unstructured":"L.A. Hageman and D.M. Young, Applied Iterative Methods (Academic Press, New York, 1981)."},{"key":"325328_CR19","series-title":"Lecture Notes in Mathematics","volume-title":"Multigrid Methods","author":"J.F. Maitre","year":"1992","unstructured":"J.F. Maitre and F. Musy, The contraction number of a class of two-level methods; an exact evaluation for some finite element subspaces and model problems, in: Multigrid Methods, eds. W. Hackbusch and U. Trottenberg, Lecture Notes in Mathematics, Vol. 960 (Springer, Berlin, 1992)."},{"key":"325328_CR20","volume-title":"Arithmetic and communication complexity of preconditioning methods","author":"M.G. Neytcheva","year":"1995","unstructured":"M.G. Neytcheva, Arithmetic and communication complexity of preconditioning methods, Ph.D. thesis, Katholieke Universiteit, Nijmegen (September 1995)."},{"key":"325328_CR21","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996)."},{"key":"325328_CR22","volume-title":"Matrix Iterative Analysis","author":"R.S. Varga","year":"1962","unstructured":"R.S. Varga, Matrix Iterative Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1962)."},{"key":"325328_CR23","volume-title":"Iterative Solution of Large Linear Systems","author":"D.M. Young","year":"1971","unstructured":"D.M. Young, Iterative Solution of Large Linear Systems (Academic Press, New York, 1971)."},{"key":"325328_CR24","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01389538","volume":"49","author":"H. Yserentant","year":"1986","unstructured":"H. Yserentant, On the multi-level splitting finite element spaces, Numer. Math. 49 (1986) 379-412.","journal-title":"Numer. Math."},{"key":"325328_CR25","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0096-3003(86)90113-X","volume":"19","author":"H. Yserentant","year":"1986","unstructured":"H. Yserentant, Hierarchical bases give conjugate gradient type methods a multigrid speed of convergence, Appl. Math. Comput. 19 (1986) 347-358.","journal-title":"Appl. Math. Comput."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018974514896.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018974514896\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018974514896.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T23:25:14Z","timestamp":1747437914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018974514896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["325328"],"URL":"https:\/\/doi.org\/10.1023\/a:1018974514896","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}