Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants

Christian Peco, Daniel Millán, Adrian Rosolen, Marino Arroyo

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)52-62
Number of pages11
JournalComputers and Structures
Volume150
DOIs
StatePublished - Apr 1 2015

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Modeling and Simulation
  • Materials Science(all)
  • Mechanical Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants'. Together they form a unique fingerprint.

Cite this