Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Peco, C.; Milian, D.; Rosolen, A.; Arroyo, M.
Tipus d'activitat
Article en revista
Revista
Computers & structures
Data de publicació
2015-04-01
Volum
150
Pàgina inicial
52
Pàgina final
62
DOI
https://doi.org/10.1016/j.compstruc.2014.12.005 Obrir en finestra nova
Projecte finançador
MODELOS DE CAMPO DE FASE PARA PROBLEMAS DE DISCONTINUIDAD LIBRE: METODOS COMPUTACIONALES Y APLICACIONES EN FRACTURA MATERIALES FERRO
MODELOS DE CAMPO DE FASE PARA PROBLEMAS DE DISCONTINUIDAD LIBRE: METODOS COMPUTACIONALES Y APLICACIONES EN FRACTURA, MATERIALES FERROELECTRICOS Y MEMBRANAS BIOLOGICAS -2
Repositori
http://hdl.handle.net/2117/80113 Obrir en finestra nova
Resum
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 par...
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.
Paraules clau
Code optimization, Local maximum entropy, Matrix structure creation, Meshfree methods, Optimal memory storage, Sparse matrix efficient assembly
Grup de recerca
LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria

Participants

  • Peco Regales, Christian  (autor)
  • Milian, Daniel  (autor)
  • Rosolen, Adrian Martin  (autor)
  • Arroyo Balaguer, Marino  (autor)

Arxius