A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
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 isdoi:10.1007/978-3-642-23099-8_6 fatcat:udnf53zhwvepxezumu2elb4wj4