{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:27:32Z","timestamp":1743085652990,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319937007"},{"type":"electronic","value":"9783319937014"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93701-4_60","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:49:52Z","timestamp":1528717792000},"page":"760-772","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids"],"prefix":"10.1007","author":[{"given":"H.","family":"AbouEisha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. M.","family":"Calo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Jopek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Moshkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Paszy\u0144ska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Paszy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"unstructured":"AbouEisha, H., Calo, V.M., Jopek, K., Moshkov, M., Paszy\u0144ska, A., Paszy\u0144ski, M., Skotniczny, M.: Element partition trees for two- and three-dimensional $$h$$-refined meshes and their use to optimize direct solver performance. Dyn. Program. Int. J. Appl. Math. Comput. Sci. (2017, accepted)","key":"60_CR1"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/S0045-7825(99)00242-X","volume":"184","author":"PR Amestoy","year":"2000","unstructured":"Amestoy, P.R., Duff, I.S.: Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184, 501\u2013520 (2000). https:\/\/doi.org\/10.1016\/S0045-7825(99)00242-X","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"23","key":"60_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/S0895479899358194","volume":"1","author":"PR Amestoy","year":"2001","unstructured":"Amestoy, P.R., Duff, I.S., Koster, J., L\u2019Excellent, J.-Y.: A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 1(23), 15\u201341 (2001). https:\/\/doi.org\/10.1137\/S0895479899358194","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"32","key":"60_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.parco.2005.07.004","volume":"2","author":"PR Amestoy","year":"2011","unstructured":"Amestoy, P.R., Guermouche, A., L\u2019Excellent, J.-Y., Pralet, S.: Hybrid scheduling for the parallel solution of linear systems. Comput. Methods Appl. Mech. Eng. 2(32), 136\u2013156 (2011). https:\/\/doi.org\/10.1016\/j.parco.2005.07.004","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"4","key":"60_CR5","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Du, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996). https:\/\/doi.org\/10.1137\/S0895479894278952","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"60_CR6","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/0715049","volume":"15","author":"I Babu\u015bka","year":"1978","unstructured":"Babu\u015bka, I., Rheinboldt, W.C.: Error estimates for adaptive finite element computations. SIAM J. Num. Anal. 15, 736\u2013754 (1978). https:\/\/doi.org\/10.1137\/0715049","journal-title":"SIAM J. Num. Anal."},{"issue":"3\u20134","key":"60_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0965-9978(92)90097-Y","volume":"15","author":"I Babuska","year":"1992","unstructured":"Babuska, I., Guo, B.Q.: The $$h$$, $$p$$ and $$hp$$ version of the finite element method: basis theory and applications. Adv. Eng. Softw. 15(3\u20134), 159\u2013174 (1992). https:\/\/doi.org\/10.1016\/0965-9978(92)90097-Y","journal-title":"Adv. Eng. Softw."},{"key":"60_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0363012999351097","volume":"39","author":"R Becker","year":"2000","unstructured":"Becker, R., Kapp, J., Rannacher, R.: Adaptive finite element methods for optimal control of partial differential equations: basic concept. SIAM J. Control Optim. 39, 113\u2013132 (2000). https:\/\/doi.org\/10.1137\/S0363012999351097","journal-title":"SIAM J. Control Optim."},{"doi-asserted-by":"crossref","unstructured":"Demkowicz, L., Kurtz, J., Pardo, D., Paszy\u0144ski, M., Rachowicz, W., Zdunek, A.: Computing with $$hp$$ Adaptive Finite Element Method. Part II. Frontiers: Three Dimensional Elliptic and Maxwell Problems with Applications. Chapmann & Hall, CRC Press, Boca Raton, London, New York (2007)","key":"60_CR9","DOI":"10.1201\/9781420011692"},{"issue":"37\u201340","key":"60_CR10","doi-asserted-by":"publisher","first-page":"4816","DOI":"10.1023\/A:1015192312705","volume":"196","author":"L Demkowicz","year":"2006","unstructured":"Demkowicz, L., Pardo, D., Rachowicz, W.: Fully automatic $$hp$$-adaptivity in three-dimensions. Comput. Methods Appl. Mech. Eng. 196(37\u201340), 4816\u20134842 (2006). https:\/\/doi.org\/10.1023\/A:1015192312705","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"60_CR11","volume-title":"Direct Methods for Sparse Matrices","author":"IS Duff","year":"1986","unstructured":"Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press Inc., New York (1986)"},{"issue":"3","key":"60_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983). https:\/\/doi.org\/10.1145\/356044.356047","journal-title":"ACM Trans. Math. Softw."},{"key":"60_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1137\/0905045","volume":"5","author":"IS Duff","year":"1984","unstructured":"Duff, I.S., Reid, K.: The multifrontal solution of unsymmetric sets of linear systems. SIAM J. Sci. Comput. 5, 633\u2013641 (1984). https:\/\/doi.org\/10.1137\/0905045","journal-title":"SIAM J. Sci. Comput."},{"key":"60_CR14","first-page":"117","volume":"16","author":"S Fia\u0142ko","year":"2009","unstructured":"Fia\u0142ko, S.: A block sparse shared-memory multifrontal finite element solver for problems of structural mechanics. Comput. Assist. Mech. Eng. Sci. 16, 117\u2013131 (2009)","journal-title":"Comput. Assist. Mech. Eng. Sci."},{"key":"60_CR15","first-page":"175","volume":"8","author":"S Fia\u0142ko","year":"2009","unstructured":"Fia\u0142ko, S.: The block subtracture multifrontal method for solution of large finite element equation sets. Tech. Trans. 1-NP 8, 175\u2013188 (2009)","journal-title":"Tech. Trans. 1-NP"},{"issue":"12","key":"60_CR16","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.advengsoft.2010.09.002","volume":"40","author":"S Fia\u0142ko","year":"2010","unstructured":"Fia\u0142ko, S.: PARFES: a method for solving finite element linear equations on multi-core computers. Adv. Eng. Softw. 40(12), 1256\u20131265 (2010). https:\/\/doi.org\/10.1016\/j.advengsoft.2010.09.002","journal-title":"Adv. Eng. Softw."},{"key":"60_CR17","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"A George","year":"1978","unstructured":"George, A.: An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Num. Anal. 15, 1053\u20131069 (1978). https:\/\/doi.org\/10.1137\/0715069","journal-title":"SIAM J. Num. Anal."},{"doi-asserted-by":"publisher","unstructured":"Gilbert, J.R., Tarjan, R.E.: The analysis of a nested dissection algorithm. Numer. Math. 50(4), 377\u2013404 (1986\/87). https:\/\/doi.org\/10.1007\/BF01396660","key":"60_CR18","DOI":"10.1007\/BF01396660"},{"key":"60_CR19","volume-title":"The Finite Element Method. Linear Statics and Dynamics Finite Element Analysis","author":"TJR Hughes","year":"1987","unstructured":"Hughes, T.J.R.: The Finite Element Method. Linear Statics and Dynamics Finite Element Analysis. Prentice-Hall, Englewood Cliffs (1987)"},{"issue":"1","key":"60_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998). https:\/\/doi.org\/10.1137\/S1064827595287997","journal-title":"SIAM J. Sci. Comput."},{"key":"60_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/b84212","volume-title":"$$hp$$-Finite Element Methods for Singular Perturbations","author":"JM Melenk","year":"2002","unstructured":"Melenk, J.M.: $$hp$$-Finite Element Methods for Singular Perturbations. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/b84212"},{"key":"60_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00366-011-0223-0","volume":"28","author":"A Niemi","year":"2012","unstructured":"Niemi, A., Babu\u015bka, I., Pitkaranta, J., Demkowicz, L.: Finite element analysis of the Girkmann problem using the modern $$hp$$-version and the classical $$h$$-version. Eng. Comput. 28, 123\u2013134 (2012). https:\/\/doi.org\/10.1007\/s00366-011-0223-0","journal-title":"Eng. Comput."},{"issue":"10","key":"60_CR23","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1016\/j.camwa.2014.09.012","volume":"68","author":"A Paszy\u0144ska","year":"2014","unstructured":"Paszy\u0144ska, A.: Volume and neighbors algorithm for finding elimination trees for three dimensional $$h$$-adaptive grids. Comput. Math. Appl. 68(10), 1467\u20131478 (2014). https:\/\/doi.org\/10.1016\/j.camwa.2014.09.012","journal-title":"Comput. Math. Appl."},{"key":"60_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/303024","volume":"2015","author":"A. Paszy\u0144ska","year":"2015","unstructured":"Paszy\u0144ska, A., Paszy\u0144ski, M., Jopek, K., Wo\u017aniak, M., Goik, D., Gurgul, P., AbouEisha, H., Moshkov, M., Calo, V.M., Lenharth, A., Nguyen, D., Pingali, K.: Quasi-optimal elimination trees for 2D grids with singularities. Sci. Program. 2015, 1\u201318, Article ID 303024 (2015). https:\/\/doi.org\/10.1155\/2015\/303024","journal-title":"Scientific Programming"},{"key":"60_CR25","doi-asserted-by":"crossref","DOI":"10.1201\/b19078","volume-title":"Fast Solvers for Mesh-Based Computations","author":"M Paszy\u0144ski","year":"2016","unstructured":"Paszy\u0144ski, M.: Fast Solvers for Mesh-Based Computations. Taylor and Francis\/CRC Press, Boca Raton, London, New York (2016)"},{"key":"60_CR26","volume-title":"$$p$$ and $$hp$$ Finite Element Methods: Theory and Applications in Solid and Fluid Mechanics","author":"C Schwab","year":"1998","unstructured":"Schwab, C.: $$p$$ and $$hp$$ Finite Element Methods: Theory and Applications in Solid and Fluid Mechanics. Clarendon Press, Oxford (1998)"},{"key":"60_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9780203488041","volume-title":"Higher-Order Finite Element Methods","author":"P Solin","year":"2003","unstructured":"Solin, P., Segeth, K., Dolezel, I.: Higher-Order Finite Element Methods. Chapman & Hall\/CRC Press, Boca Raton, London, New York (2003)"},{"issue":"3","key":"60_CR28","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.jocs.2011.09.001","volume":"4","author":"A Szymczak","year":"2013","unstructured":"Szymczak, A., Paszy\u0144ska, A., Paszy\u0144ski, M., Pardo, D.: Preventing deadlock during anisotropic 2D mesh adaptation in hp-adaptive FEM. J. Comput. Sci. 4(3), 170\u2013179 (2013). https:\/\/doi.org\/10.1016\/j.jocs.2011.09.001","journal-title":"J. Comput. Sci."},{"key":"60_CR29","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discret. Methods 2, 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","journal-title":"SIAM J. Algebraic Discret. Methods"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93701-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:19:03Z","timestamp":1654906743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93701-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319937007","9783319937014"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93701-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"406","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"148","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}