{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:24:08Z","timestamp":1769282648217,"version":"3.49.0"},"reference-count":18,"publisher":"Wiley","issue":"7-8","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Linear Algebra Appl."],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1002\/1099-1506(200010\/12)7:7\/8<635::aid-nla216>3.0.co;2-b","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T17:56:59Z","timestamp":1030298219000},"page":"635-648","source":"Crossref","is-referenced-by-count":4,"title":["Parallel block ILUT\/ILDLT preconditioning for sparse eigenproblems and sparse linear systems"],"prefix":"10.1002","volume":"7","author":[{"given":"Achim","family":"Basermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB1","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad","year":"1996","unstructured":"Iterative Methods for Sparse Linear Systems, PWS Publishing: Boston, 1996."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB2","volume-title":"Matrix Computations","author":"Golub","year":"1989","unstructured":"Matrix Computations (2nd edn). Johns Hopkins University Press: Baltimore, 1989."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"Sleijpen","year":"1996","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB4","series-title":"Series: Lectu","first-page":"59","volume-title":"The Mathematics of Numerical Analysis","author":"Basermann","year":"1996","unstructured":"QMR and TFQMR methods for sparse nonsymmetric problems on massively parallel systems. In The Mathematics of Numerical Analysis. Series: Lectures in Applied Mathematics, vol. 32. (eds). American Mathematical Society ISBN 0-8218-0530-4, 1996; 59-76."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB5","series-title":"Lecture Notes","first-page":"157","author":"B\u00fccker","year":"1996","unstructured":"A parallel version of the quasi-minimal residual method based on coupled two-term recurrences. Lecture Notes in Computer Science, vol. 1184. Springer: Berlin, 1996; 157-165."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"Freund","year":"1991","journal-title":"Numerische Mathematik"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB7","author":"B\u00fccker","year":"1997","unstructured":"A transpose-free 1-norm quasi-minimal residual algorithm for non-Hermitian linear systems. Technical Report FZJ-ZAM-IB-9706, Research Centre J\u00fclich GmbH, 1997."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB8","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0914029","volume":"14","author":"Freund","year":"1993","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB9","series-title":"Lecture Notes","first-page":"72","volume-title":"VECPAR'98 - Third International Conference for Vector and Parallel Processing","author":"Basermann","year":"1999","unstructured":"Parallel preconditioned solvers for large sparse Hermitian eigenvalue problems. In VECPAR'98 - Third International Conference for Vector and Parallel Processing. Lecture Notes in Computer Science, vol. 1573. (eds). Springer: Berlin, 1999; 72-85."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB10","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"van der Vorst","year":"1992","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB11","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/0021-9991(84)90031-7","volume":"55","author":"Kosugi","year":"1984","journal-title":"Computational Physics"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB12","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0927-5452(98)80072-5","volume-title":"Parallel Computing: Fundamentals, Applications and New Directions","author":"Basermann","year":"1998","unstructured":"Preconditioned solvers for large eigenvalue problems on massively parallel computers and workstation clusters. In Parallel Computing: Fundamentals, Applications and New Directions, (eds). Elsevier Science B.V., 1998; 565-572."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB13","first-page":"75","volume":"7","author":"Sleijpen","year":"1998","journal-title":"Elect. Transactions on Numerical Analysis"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB14","volume-title":"SPARSKIT: a basic tool kit for sparse matrix computations (version 2)","author":"Saad","year":"1994","unstructured":"SPARSKIT: a basic tool kit for sparse matrix computations (version 2). User's Manual, Computer Science Department, University of Minnesota, Minneapolis, 1994."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB15","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1002\/(SICI)1097-0207(19990630)45:6<765::AID-NME607>3.0.CO;2-A","volume":"45","author":"van Gijzen","year":"1999","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0167-8191(97)00005-7","volume":"23","author":"Basermann","year":"1997","journal-title":"Parallel Computing"},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB17","volume-title":"A Collection of Matrices for Testing Computational Algorithms","author":"Gregory","year":"1978","unstructured":"A Collection of Matrices for Testing Computational Algorithms. Krieger: Huntington, 1978."},{"key":"10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B-BIB18","series-title":"Lanczos Algor","author":"Cullum","year":"1985","unstructured":"Lanczos Algorithms for Large Symmetric Eigenvalue Computations, vol. 1. Birkh\u00e4user: Boston, 1985."}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1099-1506(200010%2F12)7:7%2F8%3C635::AID-NLA216%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1099-1506(200010\/12)7:7\/8%3C635::AID-NLA216%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T05:07:45Z","timestamp":1625116065000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1099-1506(200010\/12)7:7\/8<635::AID-NLA216>3.0.CO;2-B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":18,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2000,10]]}},"URL":"https:\/\/doi.org\/10.1002\/1099-1506(200010\/12)7:7\/8<635::aid-nla216>3.0.co;2-b","relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}