{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:40:02Z","timestamp":1751874002519,"version":"3.41.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":["Numerical Algorithms"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1023\/a:1019191715286","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"51-70","source":"Crossref","is-referenced-by-count":3,"title":["Experimental comparison of three-dimensional point and line modified incomplete factorizations"],"prefix":"10.1007","volume":"23","author":[{"given":"Mardoch\u00e9e","family":"Magolu monga Made","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Polman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329368_CR1","unstructured":"Z.O. Amar, A parallel solver for 3D-PDEs on SIMD computers, in: Iterative Methods in Linear Algebra II, eds. S. Margenov and P. Vassilevski, IMACS Series in Computational and Applied Mathematics, Vol. 3 (1996) pp. 140-155."},{"key":"329368_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/0909009","volume":"9","author":"C.C. Ashcraft","year":"1988","unstructured":"C.C. Ashcraft and R.G. Grimes, On vectorizing incomplete factorization and SSOR preconditioners, SIAM J. Sci. Statist. Comput. 9 (1988) 122-151.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329368_CR3","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1137\/0613052","volume":"13","author":"O. Axelsson","year":"1992","unstructured":"O. Axelsson, Bounds of eigenvalues of preconditioned matrices, SIAM J. Matrix Anal. Appl. 13 (1992) 847-862.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"329368_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-0427(89)90372-5","volume":"27","author":"O. Axelsson","year":"1989","unstructured":"O. Axelsson and V. Eijkhout, Vectorizable preconditioners for elliptic difference equations in three space dimensions, J. Comput. Appl. Math. 27 (1989) 299-321.","journal-title":"J. Comput. Appl. Math."},{"key":"329368_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389447","volume":"48","author":"O. Axelsson","year":"1986","unstructured":"O. Axelsson and G. Lindskog, On the eigenvalue distribution of a class of preconditioning methods, Numer. Math. 48 (1986) 479-498.","journal-title":"Numer. Math."},{"key":"329368_CR6","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1137\/S0895479893253434","volume":"16","author":"O. Axelsson","year":"1995","unstructured":"O. Axelsson and H. Lu, On eigenvalue estimates for block incomplete factorization methods, SIAM J. Matrix Anal. Appl. 16 (1995) 1074-1085.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"329368_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/03081089408818325","volume":"37","author":"O. Axelsson","year":"1994","unstructured":"O. Axelsson, H. Lu and B. Polman, On the numerical radius of matrices and its application to iterative methods, Linear and Multilinear Algebra 37 (1994) 225-238.","journal-title":"Linear and Multilinear Algebra"},{"key":"329368_CR8","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, An approximate factorization method for block matrices suitable for vector and parallel processors, Linear Algebra Appl. 77 (1986) 3-26.","journal-title":"Linear Algebra Appl."},{"key":"329368_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0377-0427(88)90343-3","volume":"24","author":"O. Axelsson","year":"1988","unstructured":"O. Axelsson and B. Polman, Block preconditioning and domain decomposition methods II, J. Comput. Appl. Math. 24 (1988) 55-72.","journal-title":"J. Comput. Appl. Math."},{"key":"329368_CR10","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.F. Barret","year":"1994","unstructured":"R.F. Barret, M. Berry, T.F. 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":"329368_CR11","doi-asserted-by":"crossref","unstructured":"R. Beauwens, Upper eigenvalue bounds for pencils of matrices, Linear Algebra Appl. 62 (1984) 87-104.","DOI":"10.1016\/0024-3795(84)90088-0"},{"key":"329368_CR12","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/BF01932739","volume":"29","author":"R. Beauwens","year":"1989","unstructured":"R. Beauwens, Approximate factorizations with S\/P consistently ordered M-factors, BIT 29 (1989) 658-681.","journal-title":"BIT"},{"key":"329368_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/nla.1680010103","volume":"1","author":"R. Beauwens","year":"1994","unstructured":"R. Beauwens, Approximate factorizations with modified S\/P consistently ordered M-factors, Numer. Linear Algebra Appl. 1 (1994) 3-17.","journal-title":"Numer. Linear Algebra Appl."},{"key":"329368_CR14","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1137\/0725053","volume":"25","author":"R. Beauwens","year":"1988","unstructured":"R. Beauwens and M. Ben Bouzid, Existence and conditioning properties of sparse approximate block factorizations, SIAM J. Numer. Anal. 25 (1988) 941-956.","journal-title":"SIAM J. Numer. Anal."},{"key":"329368_CR15","first-page":"26","volume-title":"Advances in Numerical Methods and Applications O(h3)","author":"R. Beauwens","year":"1994","unstructured":"R. Beauwens, L. Dujacquier, S. Hitimana and M. Magolu monga Made, MILU factorizations for 2-processor orderings, in: Advances in Numerical Methods and Applications O(h3), eds. I.T. Dimov, B. Sendov and P.S. Vassilevski (World Scientific, Singapore, 1994) pp. 26-34."},{"key":"329368_CR16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF02512364","volume":"38","author":"M. Benzi","year":"1998","unstructured":"M. Benzi and M. T\u0169ma, Numerical experiments with two sparse approximate inverse preconditioners, BIT 38 (1998) 234-241.","journal-title":"BIT"},{"key":"329368_CR17","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/0912035","volume":"12","author":"T.F. Chan","year":"1991","unstructured":"T.F. Chan, Fourier analysis of relaxed incomplete factorization preconditioners, SIAM J. Sci. Statist. Comput. 12 (1991) 668-680.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329368_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/1031002","volume":"31","author":"T.F. Chan","year":"1989","unstructured":"T.F. Chan and H.C. Elman, Fourier analysis of iterative methods for elliptic problems, SIAM Rev. 31 (1989) 20-49.","journal-title":"SIAM Rev."},{"key":"329368_CR19","series-title":"CAM Report 90-04","volume-title":"Fourier analysis of block preconditioners","author":"T.F. Chan","year":"1990","unstructured":"T.F. Chan and G.A. Meurant, Fourier analysis of block preconditioners, CAM Report 90-04, University of California, Los Angeles (February 1990)."},{"key":"329368_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2307\/2153326","volume":"64","author":"T.F. Chan","year":"1995","unstructured":"T.F. Chan and P.S. Vassilevski, A framework for block-ILU factorization using block-size reduction, Math. Comp. 64 (1995) 129-156.","journal-title":"Math. Comp."},{"key":"329368_CR21","series-title":"ICASE\/LaRC Interdisciplinary Series in Science and Engineering","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-011-5412-3_6","volume-title":"Parallel Numerical Algorithms","author":"T.F. Chan","year":"1997","unstructured":"T.F. Chan and H.A. van der Vorst, Approximate and incomplete factorizations, in: Parallel Numerical Algorithms, eds. D.E. Keyes, A. Samed and V. Venkatakrishnan, ICASE\/LaRC Interdisciplinary Series in Science and Engineering, Vol. 4 (Kluwer Academic, Dodrecht, 1997) pp. 167-202."},{"key":"329368_CR22","unstructured":"E. Chow and M.A. Heroux, BPKIT block preconditioning tool kit, Technical Report UMSI 96\/183, University of Minnesota, Supercomputer Institute (September 1996)."},{"key":"329368_CR23","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1137\/0906018","volume":"6","author":"P. Concus","year":"1985","unstructured":"P. Concus, G.H. Golub and G.A. 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":"329368_CR24","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF01935055","volume":"26","author":"P. Concus","year":"1986","unstructured":"P. Concus and G.A. Meurant, On computing INV block preconditionings for the conjugate gradient method, BIT 26 (1986) 493-504.","journal-title":"BIT"},{"key":"329368_CR25","doi-asserted-by":"publisher","first-page":"491","DOI":"10.2307\/2008290","volume":"43","author":"S. Demko","year":"1984","unstructured":"S. Demko, W.F. Moss and P.W. Smith, Decay rates for inverses of band matrices, Math. Comp. 43 (1984) 491-499.","journal-title":"Math. Comp."},{"key":"329368_CR26","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/0913017","volume":"13","author":"J.M. Donato","year":"1992","unstructured":"J.M. Donato and T.F. Chan, Fourier analysis of incomplete factorization preconditioners for 3-dimensional anisotropic problems, SIAM J. Sci. Statist. Comput. 13 (1992) 319-338.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329368_CR27","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719611","volume-title":"Numerical Linear Algebra for High-Performance Computers","author":"J.J. Dongarra","year":"1998","unstructured":"J.J. Dongarra, I.S. Duff, D.C. Sorensen and H.A. van der Vorst, Numerical Linear Algebra for High-Performance Computers (SIAM, Philadelphia, PA, 1998)."},{"key":"329368_CR28","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/BF01932738","volume":"29","author":"I.S. Duff","year":"1989","unstructured":"I.S. Duff and G.A. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT 29 (1989) 635-657.","journal-title":"BIT"},{"key":"329368_CR29","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1016\/S0167-8191(99)00077-0","volume":"25","author":"I.S. Duff","year":"1999","unstructured":"I.S. Duff and H.A. van der Vorst, Developments and trends in the parallel solution of linear systems, Parallel Comput. 25 (1999) 1931-1970.","journal-title":"Parallel Comput."},{"key":"329368_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1137\/0705045","volume":"5","author":"T. Dupont","year":"1968","unstructured":"T. Dupont, R.P. Kendall and H.H. Rachford, An approximate factorization procedure for solving self-adjoint elliptic difference equations, SIAM J. Numer. Anal. 5 (1968) 559-573.","journal-title":"SIAM J. Numer. Anal."},{"key":"329368_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0024-3795(88)90211-X","volume":"109","author":"V. Eijkhout","year":"1988","unstructured":"V. Eijkhout and B. Polman, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Linear Algebra Appl. 109 (1988) 247-277.","journal-title":"Linear Algebra Appl."},{"key":"329368_CR32","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1093\/oso\/9780198500148.003.0003","volume-title":"The State of the Art in Numerical Analysis","author":"G.H. Golub","year":"1997","unstructured":"G.H. Golub and H.A. van der Vorst, Closer to the solution: iterative linear solvers, in: The State of the Art in Numerical Analysis, eds. I.S. Duff and G.A. Watson (Clarendon Press, Oxford, 1997) pp. 63-92."},{"key":"329368_CR33","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"M.J. Grote","year":"1997","unstructured":"M.J. Grote and T. Huckle, Parallel preconditionings with sparse approximate inverses, SIAM J. Sci. Comput. 18 (1997) 838-853.","journal-title":"SIAM J. Sci. Comput."},{"key":"329368_CR34","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":"329368_CR35","first-page":"265","volume-title":"Preconditioning Methods. Theory and Applications","author":"I. Gustafsson","year":"1983","unstructured":"I. Gustafsson, Modified Incomplete Cholesky (MIC) methods, in: Preconditioning Methods. Theory and Applications, ed. D. Evans (Gordon and Breach, New York, 1983) pp. 265-293."},{"key":"329368_CR36","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/S0167-8191(98)00046-5","volume":"24","author":"G. Haase","year":"1998","unstructured":"G. Haase, Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution, Parallel Comput. 24 (1998) 1685-1703.","journal-title":"Parallel Comput."},{"key":"329368_CR37","unstructured":"R. Kettler, Linear multigrid methods for numerical reservoir simulation, Ph.D. thesis, Dept. of Mathematics and Informatics, Delft University of Technology (1987)."},{"key":"329368_CR38","unstructured":"L. Kolotilina, Eigenvalues bounds for block preconditioned matrices, Research Report EM-RR 16\/94, Elegant Mathematics, Inc. (June 1994)."},{"key":"329368_CR39","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01385499","volume":"61","author":"M. Magolu monga Made","year":"1992","unstructured":"M. Magolu monga Made, Modified block-approximate factorization strategies, Numer. Math. 61 (1992) 91-110.","journal-title":"Numer. Math."},{"key":"329368_CR40","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(93)90320-N","volume":"179","author":"M. Magolu monga Made","year":"1993","unstructured":"M. Magolu monga Made, Analytical bounds for block approximate factorization methods, Linear Algebra Appl. 179 (1993) 33-57.","journal-title":"Linear Algebra Appl."},{"key":"329368_CR41","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/0916024","volume":"16","author":"M. Magolu monga Made","year":"1995","unstructured":"M. Magolu monga Made, Ordering strategies for modified block incomplete factorizations, SIAM J. Sci. Comput. 16 (1995) 378-399.","journal-title":"SIAM J. Sci. Comput."},{"key":"329368_CR42","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0167-739X(94)00058-M","volume":"11","author":"M. Magolu monga Made","year":"1995","unstructured":"M. Magolu monga Made, Implementation of parallel block preconditionings on a transputer-based multiprocessor, Future Generation Computer Systems 11 (1995) 167-173.","journal-title":"Future Generation Computer Systems"},{"key":"329368_CR43","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1137\/S0036144594266284","volume":"19","author":"M. Magolu monga Made","year":"1998","unstructured":"M. Magolu monga Made, Taking advantage of the potentialities of dynamically modified block incomplete factorizations, SIAM J. Sci. Comput. 19 (1998) 1083-1108.","journal-title":"SIAM J. Sci. Comput."},{"key":"329368_CR44","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0024-3795(91)90395-D","volume":"154-156","author":"M. Magolu monga Made","year":"1991","unstructured":"M. Magolu monga Made and Y. Notay, On the conditioning analysis of block approximate factorization methods, Linear Algebra Appl. 154-156 (1991) 583-599.","journal-title":"Linear Algebra Appl."},{"key":"329368_CR45","doi-asserted-by":"crossref","unstructured":"M. Magolu monga Made and Y. Notay, Dynamically relaxed block incomplete factorization methods for solving two-and three-dimensional problems, SIAM J. Sci. Comput. (2000), to appear.","DOI":"10.1137\/S1064827596311591"},{"key":"329368_CR46","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/(SICI)1099-1506(199907\/08)6:5<379::AID-NLA170>3.0.CO;2-P","volume":"6","author":"M. Magolu monga Made","year":"1999","unstructured":"M. Magolu monga Made and B. Polman, Efficient planewise like preconditioners to cope with 3D problems, Numer. Linear Algebra Appl. 6 (1999) 379-406.","journal-title":"Numer. Linear Algebra Appl."},{"key":"329368_CR47","doi-asserted-by":"publisher","first-page":"148","DOI":"10.2307\/2005786","volume":"31","author":"J.A. Meijerink","year":"1977","unstructured":"J.A. Meijerink and H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp. 31 (1977) 148-162.","journal-title":"Math. Comp."},{"key":"329368_CR48","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/BF01934919","volume":"24","author":"G.A. Meurant","year":"1984","unstructured":"G.A. Meurant, The block preconditioned conjugate gradient method on vector computers, BIT 24 (1984) 623-633.","journal-title":"BIT"},{"key":"329368_CR49","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0613045","volume":"13","author":"G.A. Meurant","year":"1992","unstructured":"G.A. Meurant, A review on the inverse of symmetric tridiagonal and Block tridiagonal matrices, SIAM J. Matrix Anal. Appl. 13 (1992) 707-728.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"329368_CR50","volume-title":"Computational Methods in Engineering and Science","author":"S. Nakamura","year":"1977","unstructured":"S. Nakamura, Computational Methods in Engineering and Science (Wiley, New York, 1977)."},{"key":"329368_CR51","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0024-3795(91)90400-Q","volume":"154-156","author":"Y. Notay","year":"1991","unstructured":"Y. Notay, Conditioning analysis of modified block incomplete factorizations, Linear Algebra Appl. 154-156 (1991) 711-722.","journal-title":"Linear Algebra Appl."},{"key":"329368_CR52","first-page":"551","volume-title":"Iterative Methods in Linear Algebra","author":"Y. Notay","year":"1992","unstructured":"Y. Notay, Upper eigenvalue bounds and related modified incomplete factorization strategies, in: Iterative Methods in Linear Algebra, eds. R. Beauwens and P. de Groen (North-Holland, Amsterdam, 1992) pp. 551-562."},{"key":"329368_CR53","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0168-9274(92)90058-L","volume":"10","author":"Y. Notay","year":"1992","unstructured":"Y. Notay, Conditioning of Stieltjes matrices by S\/P consistently ordered approximate factorizations, Appl. Numer. Math. 10 (1992) 381-396.","journal-title":"Appl. Numer. Math."},{"key":"329368_CR54","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01385754","volume":"65","author":"Y. Notay","year":"1993","unstructured":"Y. Notay, On the convergence rate of the conjugate gradients in the presence of rounding errors, Numer. Math. 65 (1993) 301-317.","journal-title":"Numer. Math."},{"key":"329368_CR55","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1016\/0167-8191(96)80005-6","volume":"21","author":"Y. Notay","year":"1995","unstructured":"Y. Notay, An efficient parallel discrete PDE solver, Parallel Comput. 21 (1995) 1725-1748.","journal-title":"Parallel Comput."},{"key":"329368_CR56","unstructured":"Y. Notay and A. Van de Velde, Coarse grid acceleration of parallel incomplete preconditioners, in: Iterative Methods in Linear Algebra II, eds. S. Margenov and P. Vassilevski, IMACS Series in Computational and Applied Mathematics, Vol. 3 (1996) pp. 106-130."},{"key":"329368_CR57","first-page":"179","volume-title":"Proc. of the 23rd Internat. FEM Congress in Baden-Baden, IKOSS","author":"P. Saint-Georges","year":"1994","unstructured":"P. Saint-Georges, G. Warzee, R. Beauwens and Y. Notay, Robust and efficient iterative solvers of linear systems for FEM analyses, in: Proc. of the 23rd Internat. FEM Congress in Baden-Baden, IKOSS (IKO Software Service GmbH, Stuttgart, 1994) pp. 179-188."},{"key":"329368_CR58","first-page":"49","volume-title":"Iterative Methods in Linear Algebra","author":"A. van der Sluis","year":"1992","unstructured":"A. van der Sluis, The convergence behaviour of conjugate gradients and ritz values in various circumstances, in: Iterative Methods in Linear Algebra, eds. R. Beauwens and P. de Groen (North-Holland, Amsterdam, 1992) pp. 49-66."},{"key":"329368_CR59","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0903021","volume":"3","author":"H.A. van der Vorst","year":"1982","unstructured":"H.A. van der Vorst, A vectorizable variant of some ICCG methods, SIAM J. Sci. Statist. Comput. 3 (1982) 350-356.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329368_CR60","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1137\/0910071","volume":"10","author":"H.A. van der Vorst","year":"1989","unstructured":"H.A. van der Vorst, High performance preconditioning, SIAM J. Sci. Statist. Comput. 10 (1989) 1174-1185.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329368_CR61","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0010-4655(89)90162-8","volume":"53","author":"H.A. van der Vorst","year":"1989","unstructured":"H.A. van der Vorst, ICCG and related methods for 3D problems on vector computers, Comput. Phys. Commun. 53 (1989) 223-235.","journal-title":"Comput. Phys. Commun."},{"key":"329368_CR62","series-title":"Lectures Notes in Mathematics","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0090905","volume-title":"Preconditioned Conjugate Gradient Methods","author":"H.A. van der Vorst","year":"1990","unstructured":"H.A. van der Vorst, The convergence behaviour of preconditioned CG and CG-S, in: Preconditioned Conjugate Gradient Methods, eds. O. Axelsson and L. Kolotilina, Lectures Notes in Mathematics, Vol. 1457 (Springer, Berlin, 1990) pp. 126-136."},{"key":"329368_CR63","series-title":"Notes on Numerical Fluid Mechanics","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-322-85732-3_19","volume-title":"Incomplete Decomposition (ILU)-Algorithms, Theory and Applications","author":"H.A. van der Vorst","year":"1993","unstructured":"H.A. van der Vorst and G.L. Sleijpen, The effect of incomplete decomposition preconditioning on the convergence of conjugate gradients, in: Incomplete Decomposition (ILU)-Algorithms, Theory and Applications, eds. W. Hackbusch and G. Wittum, Notes on Numerical Fluid Mechanics, Vol. 41 (Vieweg, Braunschweig, 1993) pp. 179-187."},{"key":"329368_CR64","volume-title":"Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics","author":"E.L. Wachspress","year":"1966","unstructured":"E.L. Wachspress, Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics (Prentice-Hall, Englewood Cliffs, 1966)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019191715286.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019191715286\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019191715286.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:18:47Z","timestamp":1751872727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019191715286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["329368"],"URL":"https:\/\/doi.org\/10.1023\/a:1019191715286","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}