Finite element assembly [chapter]

Anders Logg, Kent-Andre Mardal, Garth N. Wells
2012 Lecture Notes in Computational Science and Engineering  
The finite element method may be viewed as a method for forming a discrete linear system AU = b or nonlinear system b(U) = 0 corresponding to the discretization of the variational form of a differential equation. A central part of the implementation of finite element methods is therefore the computation of matrices and vectors from variational forms. In this chapter, we describe the standard algorithm for computing the discrete operator (tensor) A defined in Chapter [kirby-5]. This algorithm is
more » ... . This algorithm is known as finite element assembly. We also discuss efficiency aspects of the standard algorithm and extensions to matrix-free methods.
doi:10.1007/978-3-642-23099-8_6 fatcat:udnf53zhwvepxezumu2elb4wj4