{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T13:11:17Z","timestamp":1694524277339},"reference-count":30,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2005,7,8]],"date-time":"2005-07-08T00:00:00Z","timestamp":1120780800000},"content-version":"vor","delay-in-days":3598,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A class of parallelizable preconditioned iterative methods for the solution of certain finite difference or finite element linear systems of equations is presented. The methods are based on calculation of approximate inverses of the SSOR factorization. The speed of the methods may be increased by making the approximation of the inverse more accurate. The construction of the preconditioning as well as the solution of the preconditioning systems (realized by matrix\u2013vector multiplication) can be made in parallel over the total amount of meshpoints. The methods are suitable for implementation on massively parallel computers such as connection machines. Problems with constant as well as strongly varying orthotropy are examined and the methods are compared to other parallel techniques with respect to rate of convergence, computational complexity and consumed CM200 computing time. We report a small but significant decrease in computing time compared to the (until now) most frequently used completely parallel preconditioning, the Jacobi method.<\/jats:p>","DOI":"10.1002\/nla.1680020506","type":"journal-article","created":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T22:49:47Z","timestamp":1129330187000},"page":"447-465","source":"Crossref","is-referenced-by-count":3,"title":["Completely parallelizable preconditioning methods"],"prefix":"10.1002","volume":"2","author":[{"given":"Ivar","family":"Gustafsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunhild","family":"Lindskog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2005,7,8]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932736"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053389000093"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934996"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","volume-title":"Iterative Solution Methods","author":"Axelsson O.","DOI":"10.1017\/CBO9780511624100"},{"key":"e_1_2_1_6_2","volume-title":"Finite Element Solution of Boundary Value Problems: Theory and Computation","author":"Axelsson O.","year":"1984"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620270314"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(78)90026-9"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238300"},{"key":"e_1_2_1_10_2","first-page":"127","article-title":"Iterative solution of large sparse linear systems arising in certain multidimensional approximation problem","volume":"22","author":"Benson M. W.","year":"1982","journal-title":"Utilatas Math."},{"issue":"3","key":"e_1_2_1_11_2","first-page":"245","article-title":"Parallel algorithms for the solution of certain sparse linear systems","volume":"16","author":"Benson M. W.","journal-title":"Int. J. Comput. Math."},{"key":"e_1_2_1_12_2","unstructured":"R.BensrydandA.Edfors.A parallel implementation of a finite element method for a nonlinear diffusion equation. Thesis project guided by I. Gustafsson and G. Lindskog Department of Computing Science Chalmers University of Technology G\u00f6teborg Sweden."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207169208804097"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"E.D'Azevedo V.EijkhoutandC.Romine.Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessors. Report UT CS\u201093\u2010185 (LAPACK working note 56). Department of Computer Sciences University of Tennessee Knoxville Tennessee USA 1993.","DOI":"10.2172\/10176473"},{"key":"e_1_2_1_15_2","unstructured":"J. W.Demmel M. T.HealthandH. A.van der Vorst.Parallel Numerical Algebra. Report UT CS\u201093\u2010192 (LAPACK working note 60). Department of Computer Sciences University of Tennessee Knoxville Tennessee USA 1993."},{"key":"e_1_2_1_16_2","unstructured":"V.Eijkhout.A characterization of polynomial iterative methods. Report UT CS\u201093\u2010216 (LAPACK working note 66). Department of Computer Sciences University of Tennessee Knoxville Tennessee USA 1993."},{"key":"e_1_2_1_17_2","volume-title":"Parallel Algorithms for Matrix Computations","author":"Gallivan K. A.","year":"1991"},{"key":"e_1_2_1_18_2","first-page":"265","volume-title":"Preconditioning Methods; Theory and Applications","author":"Gustafsson I.","year":"1983"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-85732-3_5"},{"key":"e_1_2_1_20_2","first-page":"137","article-title":"A parallel conjugate gradient method","volume":"1","author":"Hackbusch W.","year":"1992","journal-title":"J. Numer. Lin. Algebra Appl."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1515\/rnam.1986.1.4.293"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/0614004"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"L.KolotilinaandA.Yeremin. Incomplete block factorizations as preconditioners for sparse SPD matrices.Proc. of the IMA Workshop on Sparse and Structural Problems(Minneapolis MN Febr. 1992) 1993.","DOI":"10.1007\/978-1-4613-9353-5_8"},{"key":"e_1_2_1_24_2","unstructured":"G.LindskogandI.Gustafsson.Some experiences on the CM\u2010200 in the solution of a numerical linear algebra problem. Report 25 Numerical analysis group Department of Computing Science Chalmers University of Technology G\u00f6teborg Sweden 1993. (Talk at Second European CM users meeting at Observatoire de Paris\u2010Meudon Oct. 11\u201314 1993.)"},{"key":"e_1_2_1_25_2","unstructured":"Y.Notay.A new approximate factorization method. Research report Service de Metrologie Nucl\u00e9aire Universit\u00e9 Libre de Bruxelles Brussels Belgium 1992."},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(84)90068-2"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2112-3"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/0910073"},{"key":"e_1_2_1_29_2","volume-title":"CMSSL for CM Fortran"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1137\/0910071"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090905"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnla.1680020506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.1680020506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T04:21:35Z","timestamp":1694406095000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.1680020506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["10.1002\/nla.1680020506"],"URL":"https:\/\/doi.org\/10.1002\/nla.1680020506","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}