Abstract
The finite element method provides a formalism for generating discrete (finite) algorithms for approximating the solutions of differential equations. It should be thought of as a black box into which one puts the differential equation (boundary value problem) and out of which pops an algorithm for approximating the corresponding solutions. Such a task could conceivably be done automatically by a computer, but it necessitates an amount of mathematical skill that today still requires human involvement. The purpose of this book is to help people become adept at working the magic of this black box. The book does not focus on how to turn the resulting algorithms into computer codes, although this is at present also a complicated task. The latter is, however, a more well-defined task than the former and thus potentially more amenable to automation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brenner, S.C., Scott, L.R. (1994). Basic Concepts. In: The Mathematical Theory of Finite Element Methods. Texts in Applied Mathematics, vol 15. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4338-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4338-8_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4340-1
Online ISBN: 978-1-4757-4338-8
eBook Packages: Springer Book Archive