An efficient way to assemble finite element matrices in vector languages

From MaRDI portal
Publication:329010

DOI10.1007/S10543-015-0587-4zbMATH Open1351.65088arXiv1401.3301OpenAlexW2963397658MaRDI QIDQ329010FDOQ329010


Authors: François Cuvelier, Caroline Japhet, Gilles Scarella Edit this on Wikidata


Publication date: 21 October 2016

Published in: BIT (Search for Journal in Brave)

Abstract: Efficient Matlab codes in 2D and 3D have been proposed recently to assemble finite element matrices. In this paper we present simple, compact and efficient vectorized algorithms, which are variants of these codes, in arbitrary dimension, without the use of any lower level language. They can be easily implemented in many vector languages (e.g. Matlab, Octave, Python, Scilab, R, Julia, C++ with STL,...). The principle of these techniques is general, we present it for the assembly of several finite element matrices in arbitrary dimension, in the P1 finite element case. We also provide an extension of the algorithms to the case of a system of PDE's. Then we give an extension to piecewise polynomials of higher order. We compare numerically the performance of these algorithms in Matlab, Octave and Python, with that in FreeFEM++ and in a compiled language such as C. Examples show that, unlike what is commonly believed, the performance is not radically worse than that of C : in the best/worst cases, selected vector languages are respectively 2.3/3.5 and 2.9/4.1 times slower than C in the scalar and vector cases. We also present numerical results which illustrate the computational costs of these algorithms compared to standard algorithms and to other recent ones.


Full work available at URL: https://arxiv.org/abs/1401.3301




Recommendations




Cites Work


Cited In (16)

Uses Software





This page was built for publication: An efficient way to assemble finite element matrices in vector languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329010)