Condicions d'accésAccés restringit per política de l'editorial
(embargat fins 2017-04-01)
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.
CitacióPeco, C., Milian, D., Rosolen, A., Arroyo, M. Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants. "Computers & structures", 01 Abril 2015, vol. 150, p. 52-62.