Optimizing the evaluation of finite element matrices
Journal article, 2006

Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce the cost of building local stiffness matrices for the Laplace operator and for the trilinear form for Navier-Stokes operators. For the Laplace operator in two space dimensions, we have developed a heuristic graph algorithm that searches for such redundancies and generates code for computing the local stiffness matrices. Up to cubics, we are able to build the stiffness matrix on any triangle in less than one multiply-add pair per entry. Up to sixth degree, we can do it in less than about two pairs. Preliminary low-degree results for Poisson and Navier-Stokes operators in three dimensions are also promising. © 2005 Society for Industrial and Applied Mathematics.

Finite element

Compiler

Variational form

Author

R.C. Kirby

M.G. Knepley

Anders Logg

Chalmers, Mathematical Sciences, Mathematics

University of Gothenburg

L.R. Scott

SIAM Journal of Scientific Computing

1064-8275 (ISSN) 1095-7197 (eISSN)

Vol. 27 3 741-758

Subject Categories

Mathematics

Computational Mathematics

DOI

10.1137/040607824

More information

Created

10/6/2017