Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants
•We propose a simple method to implement matrix assembly in Galerkin meshfree methods.•By looping over groups of quadrature points, performance is significantly improved.•We propose a method to efficiently store the maximum entropy basis functions.•It stores partial information, at the expense of a...
Gespeichert in:
| Veröffentlicht in: | Computers & structures Jg. 150; S. 52 - 62 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article Verlag |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Ltd
01.04.2015
|
| Schlagworte: | |
| ISSN: | 0045-7949, 1879-2243 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We propose a simple method to implement matrix assembly in Galerkin meshfree methods.•By looping over groups of quadrature points, performance is significantly improved.•We propose a method to efficiently store the maximum entropy basis functions.•It stores partial information, at the expense of a negligible amount of extra operations.
In Galerkin meshfree methods, because of a denser and unstructured connectivity, the creation and assembly of sparse matrices is expensive. Additionally, the cost of computing basis functions can be significant in problems requiring repetitive evaluations. We show that it is possible to overcome these two bottlenecks resorting to simple and effective algorithms. First, we create and fill the matrix by coarse-graining the connectivity between quadrature points and nodes. Second, we store only partial information about the basis functions, striking a balance between storage and computation. We show the performance of these strategies in relevant problems. |
|---|---|
| AbstractList | In Galerkin meshfree methods, because of a denser and unstructured connectivity, the creation and assembly of sparse matrices is expensive. Additionally, the cost of computing basis functions can be significant in problems requiring repetitive evaluations. We show that it is possible to overcome these two bottlenecks resorting to simple and effective algorithms. First, we create and fill the matrix by coarse-graining the connectivity between quadrature points and nodes. Second, we store only partial information about the basis functions, striking a balance between storage and computation. We show the performance of these strategies in relevant problems. In Galerkin meshfree methods, because of a denser and unstructured connectivity, the creation and assembly of sparse matrices is expensive. Additionally, the cost of computing basis functions can be significant in problems requiring repetitive evaluations. We show that it is possible to overcome these two bottlenecks resorting to simple and effective algorithms. First, we create and fill the matrix by coarse-graining the connectivity between quadrature points and nodes. Second, we store only partial information about the basis functions, striking a balance between storage and computation. We show the performance of these strategies in relevant problems. (C) 2014 Elsevier Ltd. All rights reserved. Peer Reviewed •We propose a simple method to implement matrix assembly in Galerkin meshfree methods.•By looping over groups of quadrature points, performance is significantly improved.•We propose a method to efficiently store the maximum entropy basis functions.•It stores partial information, at the expense of a negligible amount of extra operations. In Galerkin meshfree methods, because of a denser and unstructured connectivity, the creation and assembly of sparse matrices is expensive. Additionally, the cost of computing basis functions can be significant in problems requiring repetitive evaluations. We show that it is possible to overcome these two bottlenecks resorting to simple and effective algorithms. First, we create and fill the matrix by coarse-graining the connectivity between quadrature points and nodes. Second, we store only partial information about the basis functions, striking a balance between storage and computation. We show the performance of these strategies in relevant problems. |
| Author | Rosolen, Adrian Arroyo, Marino Peco, Christian Millán, Daniel |
| Author_xml | – sequence: 1 givenname: Christian surname: Peco fullname: Peco, Christian – sequence: 2 givenname: Daniel surname: Millán fullname: Millán, Daniel – sequence: 3 givenname: Adrian surname: Rosolen fullname: Rosolen, Adrian – sequence: 4 givenname: Marino surname: Arroyo fullname: Arroyo, Marino email: marino.arroyo@upc.edu |
| BookMark | eNqNkUGPFCEQhYlZE2dXf4McvXRb0DB0HzxsNutqsokXPROaLhzGpmmBVvfkX5fJbDTxogdCFanvpXjvklwscUFCXjJoGbD962NrY1hzSZttOTDRMt4CyCdkx3o1NJyL7oLsAIRs1CCGZ-Qy5yMA7AXAjvy8dc5bj0uhPqwzhlqZ4uNCo6N3Zsb0xS80YD64hFiLcohTpi4mOpv0GZts6xBdUxwrnOl3Xw7ULBTDejDZZ1qVgvnhwxZolU5xfaBmreP1ySwlPydPnZkzvni8r8int7cfb9419x_u3t9c3zdWdENpUI2cd24Ug0Tl3ISqcyi7Xlg5il6Mpp9kx83EVc-M4nbqwQpV2wnB9LLvrgg769q8WZ3QYrKm6Gj8n-Z0OCiuec8HJSrz6szUdb9umIsOPlucZ7Ng3LJm-6oMspNQR988yqeYc0KnrT_7WJLxs2agT2Hpo_4dlj6FpRnXNazKq7_4NVWD0sN_kNdnEqt73zwmnU9xWpx8_VjRU_T_1PgFIVm6xQ |
| CitedBy_id | crossref_primary_10_1108_EC_06_2015_0166 crossref_primary_10_1002_nme_5269 crossref_primary_10_1002_nme_5755 crossref_primary_10_1016_j_cma_2015_10_008 crossref_primary_10_1016_j_compstruc_2016_11_008 crossref_primary_10_1016_j_finel_2023_103916 crossref_primary_10_1088_1748_3190_ad483e crossref_primary_10_1016_j_cma_2020_113115 crossref_primary_10_1016_j_jmps_2020_104160 crossref_primary_10_1016_j_cma_2016_12_024 crossref_primary_10_1016_j_compfluid_2024_106210 crossref_primary_10_1016_j_cma_2020_113089 crossref_primary_10_1016_j_compstruc_2017_01_014 crossref_primary_10_1016_j_cma_2019_02_029 crossref_primary_10_1007_s40430_021_03038_w crossref_primary_10_1016_j_compstruc_2021_106644 |
| Cites_doi | 10.1016/j.jcp.2013.04.038 10.1016/j.matcom.2008.01.003 10.1007/s004660050361 10.1002/nme.1885 10.1016/j.cma.2014.01.016 10.1016/j.cma.2003.12.019 10.1002/nme.2869 10.1016/0010-4655(88)90026-4 10.1007/s00466-013-0901-4 10.1016/S0045-7825(96)01083-3 10.1002/nme.2992 10.1016/j.cma.2012.05.015 10.1002/nme.1534 10.1007/s00466-013-0891-2 10.1016/j.tafmec.2013.12.002 10.1016/j.jcp.2013.04.046 10.1002/nme.4403 10.1016/S0045-7825(96)01085-7 10.1016/j.cma.2013.07.018 10.1016/S0045-7825(01)00327-9 10.1016/j.compstruc.2004.12.002 10.1002/fld.1650200824 10.1016/j.cma.2012.06.010 10.1115/1.1431547 10.1007/s004660050481 10.1016/S0045-7825(96)01087-0 10.1007/BF02905933 10.1007/s004660050403 10.1145/235815.235821 10.1002/nme.2793 10.1002/nme.4726 10.1002/nme.1193 10.1016/S0045-7825(96)01078-X 10.1016/S0045-7825(97)00344-7 10.1002/nme.2367 10.1002/nme.1620370205 |
| ContentType | Journal Article Publication |
| Contributor | Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental Universitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria |
| Contributor_xml | – sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental – sequence: 2 fullname: Universitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria |
| Copyright | 2014 Elsevier Ltd info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es |
| Copyright_xml | – notice: 2014 Elsevier Ltd – notice: info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a> |
| DBID | AAYXX CITATION 7SC 7U5 8FD FR3 JQ2 KR7 L7M L~C L~D XX2 |
| DOI | 10.1016/j.compstruc.2014.12.005 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Solid State and Superconductivity Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Recercat |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1879-2243 |
| EndPage | 62 |
| ExternalDocumentID | oai_recercat_cat_2072_282974 10_1016_j_compstruc_2014_12_005 S0045794914002831 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABMAC ABYKQ ACAZW ACDAQ ACGFS ACIWK ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W JJJVA KOM LG9 LY7 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG RNS ROL RPZ RXW SDF SDG SDP SES SPC SPCBC SPD SST SSV SSW SSZ T5K TN5 XPP ZMT ~02 ~G- 29F 6TJ 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABJNI ABWVN ABXDB ACKIV ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB G-2 HLZ HVGLF HZ~ OHT R2- SBC SET SEW T9H TAE VH1 WUQ ZY4 ~HD 7SC 7U5 8FD FR3 JQ2 KR7 L7M L~C L~D XX2 |
| ID | FETCH-LOGICAL-c439t-e7b223fb495e7ffde73fe5384c5b484ba8d532ad2781a72cd80c47d27de0a8583 |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000350190600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0045-7949 |
| IngestDate | Fri Nov 07 13:42:15 EST 2025 Sun Sep 28 09:40:56 EDT 2025 Sat Nov 29 04:10:38 EST 2025 Tue Nov 18 22:16:37 EST 2025 Fri Feb 23 02:26:40 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Local maximum entropy Optimal memory storage Sparse matrix efficient assembly Code optimization Meshfree methods Matrix structure creation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c439t-e7b223fb495e7ffde73fe5384c5b484ba8d532ad2781a72cd80c47d27de0a8583 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://recercat.cat/handle/2072/282974 |
| PQID | 1685805350 |
| PQPubID | 23500 |
| PageCount | 11 |
| ParticipantIDs | csuc_recercat_oai_recercat_cat_2072_282974 proquest_miscellaneous_1685805350 crossref_citationtrail_10_1016_j_compstruc_2014_12_005 crossref_primary_10_1016_j_compstruc_2014_12_005 elsevier_sciencedirect_doi_10_1016_j_compstruc_2014_12_005 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-04-01 |
| PublicationDateYYYYMMDD | 2015-04-01 |
| PublicationDate_xml | – month: 04 year: 2015 text: 2015-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computers & structures |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Eijkhout V. Distributed sparse data structures for linear algebra operations. Technical Report CS 92-169; Computer Science Department, University of Tennessee; 1992. Huerta, Belytschko, Fernández-Méndez, Rabczuk (b0020) 2004; vol. 1 Li, Liu (b0010) 2002; 55 Duarte, Oden (b0055) 1996; 139 Arroyo, Ortiz (b0110) 2006; 65 Millán, Rosolen, Arroyo (b0140) 2011; 85 Nissen, Cyron, Gravemeier, Wall (b0150) 2012; 241–244 Amiri, Anitescu, Arroyo, Bordas, Rabczuk (b0170) 2014; 53 Monaghan (b0075) 1988; 48 Rosolen, Peco, Arroyo (b0160) 2013; 249 De, Bathe (b0095) 2000; 25 Bradford Barber, Dobkin, Huhdanpaa (b0195) 1996; 22 Fernández-Méndez, Huerta (b0070) 2004; 193 Wu, Young, Hong (b0155) 2014; 53 Peco, Rosolen, Arroyo (b0165) 2013; 249 Chen, Pan, Wu, Liu (b0035) 1996; 139 Sukumar (b0105) 2004; 61 Sukumar, Malsch (b0115) 2006; 13 Chen, Pan, Rogue, Wang (b0040) 1998; 22 Babuška, Banerjee, Osborn, Li (b0065) 2008; 76 Mount MD, Arya S. A library for approximate nearest neighbor searching; 2010 Fries T, Matthies H. Classification and overview of meshfree methods. Tech. Rep.; Institute of Scientific Computing. Technical University Braunschweig, Germany, July 2004. Melenk, Babuška (b0085) 1996; 139 Hale, Baiz (b0135) 2012; 241–244 Liu, Jun, Zhang (b0080) 1995; 20 Millán, Rosolen, Arroyo (b0145) 2013; 93 Karypis, G, Kumar, V. Metis-ParMetis: unstructured graph partitioning and sparse matrix ordering system, Version 4.0.3; 2009 Hong, Bathe (b0100) 2005; 83 Dolbow, Belytschko (b0060) 1999; 23 Saad (b0210) 1996 Sukumar, Wright (b0120) 2007; 70 Fasshauer (b0025) 2006 Balay S, Brown J, Buschelman K, Gropp WD, Kaushik D, Knepley MG, et al. Portable, extensible toolkit for scientific computation; 2013 Combe, Korn (b0050) 1998; 162 Arroyo, Ortiz (b0185) 2007; vol. 57 . Belytschko, Krongauz, Organ, Fleming, Krysl (b0005) 1996; 139 Nguyen, Rabczuk, Bordas, Duflot (b0030) 2008; 79 Ullah, Coombs, Augarde (b0130) 2013; 267 Li, Peco, Millán, Arias, Arroyo (b0180) 2014 Rosolen, Millán, Arroyo (b0125) 2010; 82 Amiri, Millán, Shen, Rabczuk, Arroyo (b0175) 2014; 69 Li, Habbal, Ortiz (b0045) 2010; 83 Borden, Hughes, Landis, Verhoosel (b0215) 2014; 273 Belytschko, Lu, Gu (b0090) 1994; 37 Du, Gunzburger, Ju (b0190) 2002; 191 Hong (10.1016/j.compstruc.2014.12.005_b0100) 2005; 83 Millán (10.1016/j.compstruc.2014.12.005_b0145) 2013; 93 Amiri (10.1016/j.compstruc.2014.12.005_b0170) 2014; 53 Sukumar (10.1016/j.compstruc.2014.12.005_b0115) 2006; 13 Rosolen (10.1016/j.compstruc.2014.12.005_b0125) 2010; 82 Huerta (10.1016/j.compstruc.2014.12.005_b0020) 2004; vol. 1 Sukumar (10.1016/j.compstruc.2014.12.005_b0105) 2004; 61 Li (10.1016/j.compstruc.2014.12.005_b0010) 2002; 55 10.1016/j.compstruc.2014.12.005_b0015 Fernández-Méndez (10.1016/j.compstruc.2014.12.005_b0070) 2004; 193 10.1016/j.compstruc.2014.12.005_b0205 Chen (10.1016/j.compstruc.2014.12.005_b0035) 1996; 139 Sukumar (10.1016/j.compstruc.2014.12.005_b0120) 2007; 70 Arroyo (10.1016/j.compstruc.2014.12.005_b0185) 2007; vol. 57 Ullah (10.1016/j.compstruc.2014.12.005_b0130) 2013; 267 Nguyen (10.1016/j.compstruc.2014.12.005_b0030) 2008; 79 Duarte (10.1016/j.compstruc.2014.12.005_b0055) 1996; 139 Bradford Barber (10.1016/j.compstruc.2014.12.005_b0195) 1996; 22 Babuška (10.1016/j.compstruc.2014.12.005_b0065) 2008; 76 Peco (10.1016/j.compstruc.2014.12.005_b0165) 2013; 249 Li (10.1016/j.compstruc.2014.12.005_b0045) 2010; 83 Liu (10.1016/j.compstruc.2014.12.005_b0080) 1995; 20 Hale (10.1016/j.compstruc.2014.12.005_b0135) 2012; 241–244 Nissen (10.1016/j.compstruc.2014.12.005_b0150) 2012; 241–244 10.1016/j.compstruc.2014.12.005_b0220 Borden (10.1016/j.compstruc.2014.12.005_b0215) 2014; 273 Belytschko (10.1016/j.compstruc.2014.12.005_b0090) 1994; 37 10.1016/j.compstruc.2014.12.005_b0200 Belytschko (10.1016/j.compstruc.2014.12.005_b0005) 1996; 139 De (10.1016/j.compstruc.2014.12.005_b0095) 2000; 25 Wu (10.1016/j.compstruc.2014.12.005_b0155) 2014; 53 10.1016/j.compstruc.2014.12.005_b0225 Dolbow (10.1016/j.compstruc.2014.12.005_b0060) 1999; 23 Arroyo (10.1016/j.compstruc.2014.12.005_b0110) 2006; 65 Rosolen (10.1016/j.compstruc.2014.12.005_b0160) 2013; 249 Millán (10.1016/j.compstruc.2014.12.005_b0140) 2011; 85 Melenk (10.1016/j.compstruc.2014.12.005_b0085) 1996; 139 Du (10.1016/j.compstruc.2014.12.005_b0190) 2002; 191 Monaghan (10.1016/j.compstruc.2014.12.005_b0075) 1988; 48 Amiri (10.1016/j.compstruc.2014.12.005_b0175) 2014; 69 Li (10.1016/j.compstruc.2014.12.005_b0180) 2014 Chen (10.1016/j.compstruc.2014.12.005_b0040) 1998; 22 Fasshauer (10.1016/j.compstruc.2014.12.005_b0025) 2006 Combe (10.1016/j.compstruc.2014.12.005_b0050) 1998; 162 Saad (10.1016/j.compstruc.2014.12.005_b0210) 1996 |
| References_xml | – volume: 82 start-page: 868 year: 2010 end-page: 895 ident: b0125 article-title: On the optimum support size in meshfree methods: a variational adaptivity approach with maximum entropy approximants publication-title: Int J Numer Meth Eng – start-page: 33 year: 2006 end-page: 97 ident: b0025 article-title: Meshfree methods publication-title: Handbook of theoretical and computational nanotechnology – volume: 65 start-page: 2167 year: 2006 end-page: 2202 ident: b0110 article-title: Local maximum-entropy approximation schemes: a seamless bridge between finite elements and meshfree methods publication-title: Int J Numer Meth Eng – volume: 37 start-page: 229 year: 1994 end-page: 256 ident: b0090 article-title: Element free Galerkin methods publication-title: Int J Numer Meth Eng – volume: 249 start-page: 303 year: 2013 end-page: 319 ident: b0160 article-title: An adaptive meshfree method for phase-field models of biomembranes. Part I: approximation with maximum-entropy approximants publication-title: J Comput Phys – reference: Fries T, Matthies H. Classification and overview of meshfree methods. Tech. Rep.; Institute of Scientific Computing. Technical University Braunschweig, Germany, July 2004. – volume: 249 start-page: 320 year: 2013 end-page: 336 ident: b0165 article-title: An adaptive meshfree method for phase-field models of biomembranes. Part II: a Lagrangian approach for membranes in viscous fluids publication-title: J Comput Phys – volume: 22 start-page: 469 year: 1996 end-page: 483 ident: b0195 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans Math Softw – volume: 76 start-page: 1434 year: 2008 end-page: 1470 ident: b0065 article-title: Quadrature for meshless methods publication-title: Int J Numer Meth Eng – volume: 13 start-page: 129 year: 2006 end-page: 163 ident: b0115 article-title: Recent advances in the construction of polygonal finite element interpolants publication-title: Arch Comput Meth Eng – volume: 139 start-page: 289 year: 1996 end-page: 314 ident: b0085 article-title: The partition of unity finite element method: basic theory and applications publication-title: Comp Meth Appl Mech Eng – volume: 191 start-page: 1349 year: 2002 end-page: 1366 ident: b0190 article-title: Meshfree, probabilistic determination of point sets and support regions for meshless computing publication-title: Comp Meth Appl Mech Eng – volume: 139 start-page: 195 year: 1996 end-page: 227 ident: b0035 article-title: Reproducing kernel particle methods for large deformation analysis of nonlinear structures publication-title: Comp Meth Appl Mech Eng – volume: 20 start-page: 1081 year: 1995 end-page: 1106 ident: b0080 article-title: Reproducing kernel particle methods publication-title: Int J Numer Meth Fluids – volume: 139 start-page: 3 year: 1996 end-page: 47 ident: b0005 article-title: Meshless methods: an overview and recent developments publication-title: Comp Meth Appl Mech Eng – volume: 79 start-page: 763 year: 2008 end-page: 813 ident: b0030 article-title: Meshless methods: a review and computer implementation aspects publication-title: Math Comp Simul – reference: Eijkhout V. Distributed sparse data structures for linear algebra operations. Technical Report CS 92-169; Computer Science Department, University of Tennessee; 1992. – volume: 93 start-page: 685 year: 2013 end-page: 713 ident: b0145 article-title: Nonlinear manifold learning for meshfree finite deformation thin shell analysis publication-title: Int J Numer Meth Eng – reference: Mount MD, Arya S. A library for approximate nearest neighbor searching; 2010 < – volume: 193 start-page: 1257 year: 2004 end-page: 1275 ident: b0070 article-title: Imposing essential boundary conditions in mesh-free methods publication-title: Comp Meth Appl Mech Eng – volume: 70 start-page: 181 year: 2007 end-page: 205 ident: b0120 article-title: Overview and construction of meshfree basis functions: from moving least squares to entropy approximants publication-title: Int J Numer Meth Eng – volume: 25 start-page: 329 year: 2000 end-page: 345 ident: b0095 article-title: The method of finite spheres publication-title: Comput Mech – volume: 69 start-page: 102 year: 2014 end-page: 109 ident: b0175 article-title: Phase-field modeling of fracture mechanics in linear thin shells publication-title: Theoret Appl Fract Mech – volume: vol. 1 start-page: 279 year: 2004 end-page: 309 ident: b0020 article-title: Meshfree methods publication-title: Encyclopedia of computational mechanics – volume: 53 start-page: 189 year: 2014 end-page: 200 ident: b0155 article-title: Adaptive meshless local maximum-entropy finite element method for convection–diffusion problems publication-title: Comput Mech – volume: 22 start-page: 289 year: 1998 end-page: 307 ident: b0040 article-title: A lagrangian reproducing kernel particle method for metal forming analysis publication-title: Comput Mech – volume: 241–244 start-page: 311 year: 2012 end-page: 322 ident: b0135 article-title: A locking-free meshfree method for the simulation of shear-deformable plates based on a mixed variational formulation publication-title: Comp Meth Appl Mech Eng – reference: Karypis, G, Kumar, V. Metis-ParMetis: unstructured graph partitioning and sparse matrix ordering system, Version 4.0.3; 2009 < – volume: 139 start-page: 237 year: 1996 end-page: 262 ident: b0055 article-title: An h–p adaptive method using clouds publication-title: Comp Meth Appl Mech Eng – volume: 241–244 start-page: 225 year: 2012 end-page: 237 ident: b0150 article-title: Information-flux method: a meshfree maximum-entropy Petrov–Galerkin method including stabilised finite element methods publication-title: Comp Meth Appl Mech Eng – year: 2014 ident: b0180 article-title: Phase-field modeling and simulation of fracture in brittle materials with strongly anisotropic surface energy publication-title: Int J Numer Meth Eng – reference: Balay S, Brown J, Buschelman K, Gropp WD, Kaushik D, Knepley MG, et al. Portable, extensible toolkit for scientific computation; 2013 < – volume: 23 start-page: 219 year: 1999 end-page: 230 ident: b0060 article-title: Numerical integration of the Galerkin weak form in meshfree methods publication-title: Comput Mech – reference: >. – volume: 55 start-page: 1 year: 2002 end-page: 34 ident: b0010 article-title: Meshfree and particle methods and their applications publication-title: Appl Mech Rev – volume: 83 start-page: 1386 year: 2005 end-page: 1395 ident: b0100 article-title: Coupling and enrichment schemes for finite element and finite sphere discretizations publication-title: Comp Struct – volume: 267 start-page: 111 year: 2013 end-page: 132 ident: b0130 article-title: An adaptive finite element/meshless coupled method based on local maximum entropy shape functions for linear and nonlinear problems publication-title: Comp Meth Appl Mech Eng – volume: 83 start-page: 1541 year: 2010 end-page: 1579 ident: b0045 article-title: Optimal transportation meshfree approximation schemes for fluid and plastic flows publication-title: Int J Numer Meth Eng – volume: 61 start-page: 2159 year: 2004 end-page: 2181 ident: b0105 article-title: Construction of polygonal interpolants: a maximum entropy approach publication-title: Int J Numer Meth Eng – volume: 273 start-page: 100 year: 2014 end-page: 118 ident: b0215 article-title: A higher-order phase-field model for brittle fracture: formulation and analysis within the isogeometric analysis framework publication-title: Comp Meth Appl Mech Eng – volume: 53 start-page: 45 year: 2014 end-page: 57 ident: b0170 article-title: XLME interpolants, a seamless bridge between XFEM and enriched meshless methods publication-title: Comput Mech – year: 1996 ident: b0210 article-title: Iterative methods for linear systems – volume: 48 start-page: 89 year: 1988 end-page: 96 ident: b0075 article-title: An introduction to SPH publication-title: Comp Phys Commun – volume: 162 start-page: 203 year: 1998 end-page: 222 ident: b0050 article-title: An adaptive approach with the element-free-Galerkin method publication-title: Comp Meth Appl Mech Eng – volume: 85 start-page: 723 year: 2011 end-page: 751 ident: b0140 article-title: Thin shell analysis from scattered points with maximum-entropy approximants publication-title: Int J Numer Meth Eng – volume: vol. 57 start-page: 1 year: 2007 end-page: 16 ident: b0185 article-title: Meshfree methods for partial differential equations III publication-title: Lecture notes in computational science and engineering – volume: vol. 1 start-page: 279 year: 2004 ident: 10.1016/j.compstruc.2014.12.005_b0020 article-title: Meshfree methods – volume: 249 start-page: 320 year: 2013 ident: 10.1016/j.compstruc.2014.12.005_b0165 article-title: An adaptive meshfree method for phase-field models of biomembranes. Part II: a Lagrangian approach for membranes in viscous fluids publication-title: J Comput Phys doi: 10.1016/j.jcp.2013.04.038 – volume: 79 start-page: 763 issue: 3 year: 2008 ident: 10.1016/j.compstruc.2014.12.005_b0030 article-title: Meshless methods: a review and computer implementation aspects publication-title: Math Comp Simul doi: 10.1016/j.matcom.2008.01.003 – volume: 22 start-page: 289 year: 1998 ident: 10.1016/j.compstruc.2014.12.005_b0040 article-title: A lagrangian reproducing kernel particle method for metal forming analysis publication-title: Comput Mech doi: 10.1007/s004660050361 – ident: 10.1016/j.compstruc.2014.12.005_b0220 – volume: 70 start-page: 181 issue: 2 year: 2007 ident: 10.1016/j.compstruc.2014.12.005_b0120 article-title: Overview and construction of meshfree basis functions: from moving least squares to entropy approximants publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1885 – year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0210 – volume: 273 start-page: 100 year: 2014 ident: 10.1016/j.compstruc.2014.12.005_b0215 article-title: A higher-order phase-field model for brittle fracture: formulation and analysis within the isogeometric analysis framework publication-title: Comp Meth Appl Mech Eng doi: 10.1016/j.cma.2014.01.016 – volume: 193 start-page: 1257 issue: 12–14 year: 2004 ident: 10.1016/j.compstruc.2014.12.005_b0070 article-title: Imposing essential boundary conditions in mesh-free methods publication-title: Comp Meth Appl Mech Eng doi: 10.1016/j.cma.2003.12.019 – volume: 83 start-page: 1541 issue: 12 year: 2010 ident: 10.1016/j.compstruc.2014.12.005_b0045 article-title: Optimal transportation meshfree approximation schemes for fluid and plastic flows publication-title: Int J Numer Meth Eng doi: 10.1002/nme.2869 – ident: 10.1016/j.compstruc.2014.12.005_b0205 – start-page: 33 year: 2006 ident: 10.1016/j.compstruc.2014.12.005_b0025 article-title: Meshfree methods – volume: 48 start-page: 89 year: 1988 ident: 10.1016/j.compstruc.2014.12.005_b0075 article-title: An introduction to SPH publication-title: Comp Phys Commun doi: 10.1016/0010-4655(88)90026-4 – volume: 53 start-page: 189 year: 2014 ident: 10.1016/j.compstruc.2014.12.005_b0155 article-title: Adaptive meshless local maximum-entropy finite element method for convection–diffusion problems publication-title: Comput Mech doi: 10.1007/s00466-013-0901-4 – volume: 139 start-page: 195 year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0035 article-title: Reproducing kernel particle methods for large deformation analysis of nonlinear structures publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(96)01083-3 – ident: 10.1016/j.compstruc.2014.12.005_b0015 – volume: 85 start-page: 723 issue: 6 year: 2011 ident: 10.1016/j.compstruc.2014.12.005_b0140 article-title: Thin shell analysis from scattered points with maximum-entropy approximants publication-title: Int J Numer Meth Eng doi: 10.1002/nme.2992 – volume: 241–244 start-page: 225 year: 2012 ident: 10.1016/j.compstruc.2014.12.005_b0150 article-title: Information-flux method: a meshfree maximum-entropy Petrov–Galerkin method including stabilised finite element methods publication-title: Comp Meth Appl Mech Eng doi: 10.1016/j.cma.2012.05.015 – volume: 65 start-page: 2167 issue: 13 year: 2006 ident: 10.1016/j.compstruc.2014.12.005_b0110 article-title: Local maximum-entropy approximation schemes: a seamless bridge between finite elements and meshfree methods publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1534 – volume: 53 start-page: 45 year: 2014 ident: 10.1016/j.compstruc.2014.12.005_b0170 article-title: XLME interpolants, a seamless bridge between XFEM and enriched meshless methods publication-title: Comput Mech doi: 10.1007/s00466-013-0891-2 – volume: 69 start-page: 102 year: 2014 ident: 10.1016/j.compstruc.2014.12.005_b0175 article-title: Phase-field modeling of fracture mechanics in linear thin shells publication-title: Theoret Appl Fract Mech doi: 10.1016/j.tafmec.2013.12.002 – volume: 249 start-page: 303 year: 2013 ident: 10.1016/j.compstruc.2014.12.005_b0160 article-title: An adaptive meshfree method for phase-field models of biomembranes. Part I: approximation with maximum-entropy approximants publication-title: J Comput Phys doi: 10.1016/j.jcp.2013.04.046 – volume: 93 start-page: 685 issue: 7 year: 2013 ident: 10.1016/j.compstruc.2014.12.005_b0145 article-title: Nonlinear manifold learning for meshfree finite deformation thin shell analysis publication-title: Int J Numer Meth Eng doi: 10.1002/nme.4403 – volume: 139 start-page: 237 year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0055 article-title: An h–p adaptive method using clouds publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(96)01085-7 – volume: 267 start-page: 111 year: 2013 ident: 10.1016/j.compstruc.2014.12.005_b0130 article-title: An adaptive finite element/meshless coupled method based on local maximum entropy shape functions for linear and nonlinear problems publication-title: Comp Meth Appl Mech Eng doi: 10.1016/j.cma.2013.07.018 – volume: 191 start-page: 1349 issue: 13–14 year: 2002 ident: 10.1016/j.compstruc.2014.12.005_b0190 article-title: Meshfree, probabilistic determination of point sets and support regions for meshless computing publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(01)00327-9 – volume: 83 start-page: 1386 year: 2005 ident: 10.1016/j.compstruc.2014.12.005_b0100 article-title: Coupling and enrichment schemes for finite element and finite sphere discretizations publication-title: Comp Struct doi: 10.1016/j.compstruc.2004.12.002 – volume: 20 start-page: 1081 year: 1995 ident: 10.1016/j.compstruc.2014.12.005_b0080 article-title: Reproducing kernel particle methods publication-title: Int J Numer Meth Fluids doi: 10.1002/fld.1650200824 – volume: 241–244 start-page: 311 year: 2012 ident: 10.1016/j.compstruc.2014.12.005_b0135 article-title: A locking-free meshfree method for the simulation of shear-deformable plates based on a mixed variational formulation publication-title: Comp Meth Appl Mech Eng doi: 10.1016/j.cma.2012.06.010 – ident: 10.1016/j.compstruc.2014.12.005_b0200 – volume: 55 start-page: 1 issue: 1 year: 2002 ident: 10.1016/j.compstruc.2014.12.005_b0010 article-title: Meshfree and particle methods and their applications publication-title: Appl Mech Rev doi: 10.1115/1.1431547 – volume: 25 start-page: 329 year: 2000 ident: 10.1016/j.compstruc.2014.12.005_b0095 article-title: The method of finite spheres publication-title: Comput Mech doi: 10.1007/s004660050481 – volume: 139 start-page: 289 issue: 1–4 year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0085 article-title: The partition of unity finite element method: basic theory and applications publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(96)01087-0 – volume: 13 start-page: 129 issue: 1 year: 2006 ident: 10.1016/j.compstruc.2014.12.005_b0115 article-title: Recent advances in the construction of polygonal finite element interpolants publication-title: Arch Comput Meth Eng doi: 10.1007/BF02905933 – volume: 23 start-page: 219 year: 1999 ident: 10.1016/j.compstruc.2014.12.005_b0060 article-title: Numerical integration of the Galerkin weak form in meshfree methods publication-title: Comput Mech doi: 10.1007/s004660050403 – ident: 10.1016/j.compstruc.2014.12.005_b0225 – volume: 22 start-page: 469 year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0195 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans Math Softw doi: 10.1145/235815.235821 – volume: 82 start-page: 868 issue: 7 year: 2010 ident: 10.1016/j.compstruc.2014.12.005_b0125 article-title: On the optimum support size in meshfree methods: a variational adaptivity approach with maximum entropy approximants publication-title: Int J Numer Meth Eng doi: 10.1002/nme.2793 – year: 2014 ident: 10.1016/j.compstruc.2014.12.005_b0180 article-title: Phase-field modeling and simulation of fracture in brittle materials with strongly anisotropic surface energy publication-title: Int J Numer Meth Eng doi: 10.1002/nme.4726 – volume: 61 start-page: 2159 issue: 12 year: 2004 ident: 10.1016/j.compstruc.2014.12.005_b0105 article-title: Construction of polygonal interpolants: a maximum entropy approach publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1193 – volume: 139 start-page: 3 issue: 1 year: 1996 ident: 10.1016/j.compstruc.2014.12.005_b0005 article-title: Meshless methods: an overview and recent developments publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(96)01078-X – volume: 162 start-page: 203 year: 1998 ident: 10.1016/j.compstruc.2014.12.005_b0050 article-title: An adaptive approach with the element-free-Galerkin method publication-title: Comp Meth Appl Mech Eng doi: 10.1016/S0045-7825(97)00344-7 – volume: 76 start-page: 1434 year: 2008 ident: 10.1016/j.compstruc.2014.12.005_b0065 article-title: Quadrature for meshless methods publication-title: Int J Numer Meth Eng doi: 10.1002/nme.2367 – volume: 37 start-page: 229 year: 1994 ident: 10.1016/j.compstruc.2014.12.005_b0090 article-title: Element free Galerkin methods publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1620370205 – volume: vol. 57 start-page: 1 year: 2007 ident: 10.1016/j.compstruc.2014.12.005_b0185 article-title: Meshfree methods for partial differential equations III |
| SSID | ssj0006400 |
| Score | 2.227715 |
| Snippet | •We propose a simple method to implement matrix assembly in Galerkin meshfree methods.•By looping over groups of quadrature points, performance is... In Galerkin meshfree methods, because of a denser and unstructured connectivity, the creation and assembly of sparse matrices is expensive. Additionally, the... |
| SourceID | csuc proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 52 |
| SubjectTerms | 74 Mechanics of deformable solids 74S Numerical methods Anàlisi numèrica Assembly Balancing Basis functions Classificació AMS Code optimization CONSTRUCTION FINITE-ELEMENT-METHOD FORMULATION FRACTURE Galerkin methods INTERPOLANTS KERNEL PARTICLE METHODS Local maximum entropy Matemàtiques i estadística Matrix structure creation Maximum entropy Meshfree methods MESHLESS METHODS Mètodes numèrics Numerical methods and algorithms Optimal memory storage PHASE-FIELD MODELS Resistència de materials SCHEMES SEAMLESS BRIDGE Sparse matrix efficient assembly Stores Strategy Àrees temàtiques de la UPC |
| Title | Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants |
| URI | https://dx.doi.org/10.1016/j.compstruc.2014.12.005 https://www.proquest.com/docview/1685805350 https://recercat.cat/handle/2072/282974 |
| Volume | 150 |
| WOSCitedRecordID | wos000350190600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2243 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006400 issn: 0045-7949 databaseCode: AIEXJ dateStart: 19950103 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Li9swEBYh20N7KH3S9IUKPTUY_JAjubdQ0hdl2cMWchOyLNMsGzvYyZI99Xf133X0sp1tId1DDzGxguQo80UzGs18g9DbTMUslzMSZHmZBAT2PYEAyzWY5SHLYL-SUFu15Bs9PWXLZXY2Gv3yuTBXl7Sq2H6fbf6rqKENhK1TZ28h7m5QaID3IHS4gtjh-k-CXxhSCH3Ev1r74HBvFn4CdaCd49O1an-UjVKugrQhZZhe6qjwoAWp6ewpU2imS36bKhC7MOwl0FvsV-vdeqo9w_Xm2hKTQ5NwvFAd9YErGdEagFmq2l3TRy2ewd63ZzgYAFVnKJoj_Kjq8-D7s6FWBxOYVa1oBr3mTVNf1y4DaVXVQ49GlA4CYdwqTTSNpqUy7VZpy0_r1lnLeus0tl3O_9AF1i1xoUW5MTPUgXzEOH_DtFd__sj_hlbsYhV9GNwF7wbieiAexdyw557ENM3YGJ3MvyyWXzszYEZ8_pOdzEFw4V-_04FpNJbtTh5YSDdsBWMAnT9A993OBc8t4h6ikaoeoXsDPsvH6GeHPXyIPVyX2GMPe-xhhz0M2MMD7GGPPayxh0WFPfYwjOSwhx328BB7T9D3j4vzD58DV-EjkGAIbwNFczBPyxx26YqWZaFoUipQwUSmOWEkF6xIk1gUMWWRoLEsWCgJhdtChYKlLHmKxlVdqWcIa4c-i5NsVpQRCVWRhZkStCSFkmURJWyCZv7H5dLR3-sqLJf8iIAnKOw6biwDzPEu77T0ONgsqpFiyzWHe3ejX3FIY66DGCiZoPdextxZvdaa5QDk409641HBQS_owz5RqXrX8kgXltDkTeHz20_gBbrb_zFfojF8rl6hO_Jqu2qb1w7pvwHY7udm |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+implementation+of+Galerkin+meshfree+methods+for+large-scale+problems+with+an+emphasis+on+maximum+entropy+approximants&rft.jtitle=Computers+%26+structures&rft.au=Peco%2C+Christian&rft.au=Mill%C3%A1n%2C+Daniel&rft.au=Rosolen%2C+Adrian&rft.au=Arroyo%2C+Marino&rft.date=2015-04-01&rft.issn=0045-7949&rft.volume=150&rft.spage=52&rft.epage=62&rft_id=info:doi/10.1016%2Fj.compstruc.2014.12.005&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_compstruc_2014_12_005 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0045-7949&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0045-7949&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0045-7949&client=summon |