{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T18:53:14Z","timestamp":1787597594093,"version":"build-2736575974"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0167-739x(00)00076-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:22:19Z","timestamp":1027617739000},"page":"69-78","source":"Crossref","is-referenced-by-count":238,"title":["PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation"],"prefix":"10.1016","volume":"18","author":[{"given":"Olaf","family":"Schenk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Fichtner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Stricker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(00)00076-5_BIB1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1177\/109434209300700105","article-title":"Memory management issues in sparse multifrontal methods on multiprocessors","volume":"7","author":"Amestoy","year":"1993","journal-title":"Int. J. Supercomput. Appl."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB2","doi-asserted-by":"crossref","unstructured":"P. Amestoy, I. Duff, J. L\u2019Excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers (special issue), Comput. Meth. Appl. Mech. Eng.: Domain Decomposition and Parallel Computing 184 (2000) 501\u2013520.","DOI":"10.1016\/S0045-7825(99)00242-X"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1090\/S0025-5718-1977-0428694-0","article-title":"Some stable methods for calculating inertia and solving symmetric linear systems","volume":"31","author":"Bunch","year":"1977","journal-title":"Math. Comput."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB4","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/S0895479897317685","article-title":"An asynchronous parallel supernodal algorithm to sparse partial pivoting","volume":"20","author":"Demmel","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0377-0427(89)90368-3","article-title":"Multiprocessing a sparse matrix code on the Alliant FX\/8","volume":"27","author":"Duff","year":"1989","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB6","unstructured":"D. Fokkema, Subspace methods for linear, nonlinear, and eigen problems, Ph.D. Thesis, Utrecht University, 1996."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB7","unstructured":"Integrated Systems Engineering AG, DESSIS\u2212ISE Reference Manual, ISE Integrated Systems Engineering AG, 1998. http:\/\/www.ise.com."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB8","unstructured":"Integrated Systems Engineering AG, DIOS\u2212ISE Reference Manual, ISE Integrated Systems Engineering AG, 1998. http:\/\/www.ise.com."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB9","doi-asserted-by":"crossref","unstructured":"M. Joshi, G. Karypis, A. Gupta, F. Gustavson, PSPASES: scalable parallel direct solver for sparse systems, in: T. Yang (Ed.), Parallel Numerical Computations with Applications, Vol. 515, Kluwer Academic Publishers, Boston, 1999, pp. 3\u201318.","DOI":"10.1007\/978-1-4615-5205-5_1"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB10","unstructured":"G. Karypis, V. Kumar, Analysis of multilevel graph algorithms, Technical Report MN 95-037, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, 1995."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB12","doi-asserted-by":"crossref","unstructured":"A. Liegmann, Efficient solution of large sparse linear systems, Ph.D. Thesis, ETH Z\u00fcrich, Z\u00fcrich, 1995.","DOI":"10.1007\/978-3-7091-6619-2_110"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB14","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0914048","article-title":"A supernodal Cholesky factorization algorithm for shared-memory multiprocessors","volume":"14","author":"Ng","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB15","unstructured":"Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, 1996."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB16","doi-asserted-by":"crossref","unstructured":"O. Schenk, Scalable parallel sparse LU factorization methods on shared memory multiprocessors, Ph.D. Thesis, ETH Z\u00fcrich, Z\u00fcrich, 2000.","DOI":"10.1007\/BFb0100583"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB17","doi-asserted-by":"crossref","unstructured":"O. Schenk, K. G\u00e4rtner, W. Fichtner, Scalable parallel sparse factorization with left\u2013right looking strategy on shared memory multiprocessors, in: A.H.P. Sloot, M. Bubak, B. Hertzberger (Eds.), High Performance Computing and Networking, Lecture Notes in Computer Science, Vol. 1593, Springer, Berlin, 1999, pp. 221\u2013230.","DOI":"10.1007\/BFb0100583"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1023\/A:1022326604210","article-title":"Efficient sparse LU factorization with left\u2013right looking strategy on shared memory multiprocessors","volume":"40","author":"Schenk","year":"2000","journal-title":"BIT"},{"key":"10.1016\/S0167-739X(00)00076-5_BIB19","unstructured":"G. Sleijpen, H. van der Vorst, D. Fokkema, BiCGSTAB(l) and other hybrid Bi-CG methods, Technical Report TR No. 831, Department of Mathematics, Utrecht University, 1993."},{"key":"10.1016\/S0167-739X(00)00076-5_BIB20","unstructured":"S. Sze, Semiconductor Devices, Physics and Technology, Wiley, New York, 1985."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T11:46:10Z","timestamp":1580211970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X00000765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0167739X00000765"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(00)00076-5","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}