{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:44Z","timestamp":1725664244086},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:31Z","timestamp":1330269031000},"page":"181-196","source":"Crossref","is-referenced-by-count":0,"title":["Deepness analysis: Bringing optimal fronts to triangular finite element method"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Galtier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","unstructured":"J.J. Dongarra, I.S. Duff, D.C. Sorensen and H.A. Van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. 1991."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-8191(86)90019-0","volume":"3","author":"I.S. Duff","year":"1986","unstructured":"I.S. Duff. Parallel implementation of multifrontal schemes. Parallel Computing, 3:193\u2013204, 1986.","journal-title":"Parallel Computing"},{"key":"16_CR3","unstructured":"I.S. Duff, A.S. Erisman and J.K. Reid. Direct Methods for Sparse Matrices. Oxford Science Publications, 1986."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"I.S. Duff and J.K. Reid. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw., 9:302\u2013325, 1983.","journal-title":"ACM Trans. Math. Softw."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/0905045","volume":"5","author":"I.S. Duff","year":"1984","unstructured":"I.S. Duff and J.K. Reid. The multifrontal solution of unsymmetric sets of linear equations. SIAM J. Sci. Stat. Comput., 5:633\u2013641, 1984.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"16_CR6","unstructured":"I.S. Duff and J.A. Scott. MA42 \u2014 A new frontal code for solving sparse unsymmetric systems. Rutherford Appleton Laboratory, Report RAL-93-064, September 93."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1093\/imamat\/4.3.295","volume":"4","author":"D.J. Evans","year":"1967","unstructured":"D.J. Evans. The use of preconditioning in iterative methods for solving linear equations with symmetric positive definite matrices. J. Inst. Maths. Applics., 4:295\u2013314, 1967.","journal-title":"J. Inst. Maths. Applics."},{"key":"16_CR8","unstructured":"J. Galtier Deepness analysis: bringinig optimal fronts to triangular finite element analysis. ACAPS memo 73, ACAPS Lab., McGill University, Montreal, Canada."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"A. George. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. Vol.10 No2, April 1973","DOI":"10.1137\/0710032"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"A.J. Hoffman, M.S. Martin and D.J. Rose. Complexity bounds for regular finite difference and finite element grids. SIAM J. Numer. Anal., Vol.10 No2, April 1973","DOI":"10.1137\/0710033"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/nme.1620100209","volume":"10","author":"P. Hood","year":"1976","unstructured":"P. Hood. Frontal Solution Program for Unsymmetric Matrices. Int. J. num. Meth. Engng., 10:379\u2013399, 1976.","journal-title":"Int. J. num. Meth. Engng."},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/nme.1620020104","volume":"2","author":"B. Irons","year":"1970","unstructured":"B. Irons. A Frontal Solution Program for Finite Element Analysis. Int. J. num. Meth. Engng., 2:5\u201332, 1970.","journal-title":"Int. J. num. Meth. Engng."},{"key":"16_CR13","unstructured":"D.A.H. Jacobs. Preconditioned conjugate gradient methods for solving systems of algebraic equations. Note No. RD\/L\/Nl93\/80, CERL, Leatherhead, 1980."},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/nme.1620020406","volume":"2","author":"P. King","year":"1970","unstructured":"P. King. Automatic reordering scheme for simultaneous equations derived from network systems. Int. J. num. Meth. Engng., 2:523\u2013533, 1970.","journal-title":"Int. J. num. Meth. Engng."},{"issue":"No2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton, D.J. Rose and R.E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., Vol. 16, No 2:346\u2013358, 1979.","journal-title":"SIAM J. Numer. Anal."},{"key":"16_CR16","unstructured":"J.K. Reid. Frontal methods for solving finite-element systems of linear equations. Sparse Matrices and Their Uses, I.S. Duff (editor), Academic Press Inc. (London) LTD, 1981."},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"D.J. Rose. Triangulated graphs and the elimination process. J. of Math. Anal. and Appl., 32:597\u2013609, 1970.","journal-title":"J. of Math. Anal. and Appl."},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1002\/nme.1620190805","volume":"19","author":"S.W. Sloan","year":"1983","unstructured":"S.W. Sloan and M.F. Randolph. Automatic Element Reordering for Finite Element Analysis with frontal solution schemes. Int. J. num. Meth. Engng., 19:1153\u20131181, 1983.","journal-title":"Int. J. num. Meth. Engng."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"W.F. Tinney and J.W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. of the IEEE, Vol.55, No11, November 1967.","DOI":"10.1109\/PROC.1967.6011"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth., Vol.2, No1, March 1981.","DOI":"10.1137\/0602010"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:44Z","timestamp":1605647804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}