Finite Element Method for Elliptic Problems
Finite Element Method for Elliptic Problems
Singularity-free evaluation of collapsed-coordinate orthogonal polynomials
ACM Transactions on Mathematical Software (TOMS)
Efficient Assembly of $H(\mathrm{div})$ and $H(\mathrm{curl})$ Conforming Finite Elements
SIAM Journal on Scientific Computing
Robust equilibrated a posteriori error estimators for the Reissner-Mindlin system
Calcolo: a quarterly on numerical analysis and theory of computation
Computers & Mathematics with Applications
Hi-index | 0.01 |
In this work we propose a new algorithm to evaluate the basis functions of the Argyris finite element and their derivatives. The main novelty here is an efficient way to calculate the matrix which gives the change of coordinates between the bases of the Argyis element for the reference and for an arbitrary triangle. This matrix is factored as the product of two rectangular matrices with a strong block structure which makes their computation very easy. We show and comment on an implementation of this algorithm in Matlab. Two numerical experiments, an interpolation of a smooth function on a triangle and the finite-element solution of the Dirichlet problem for the biLaplacian, are presented in the last section to check the performance of our implementation.