Mathematical Foundations of Least-Squares Finite Element Methods

  • Pavel B. Bochev
  • Max D. Gunzburger
Part of the Applied Mathematical Sciences book series (AMS, volume 166)

In Section 2.2, we introduced many of the ideas that form the core of modern leastsquares finite element methods (LSFEMs). In this chapter, we develop a mathematical theory that makes precise the key ideas and provides a rigorous framework for the application of least-squares principles. At the center of our framework is an abstract least-squares theory for solving operator equations in Hilbert spaces. The specialization of this framework to partial differential equation (PDE) problems provides a template for LSFEMs that is used throughout the book.

The remainder of the chapter is devoted to the formulation and analysis of the discrete least-squares principle (DLSPs) that define least-squares finite element approximations of the solution of the PDE problem. We present the theory in two stages. The first stage (see Section 3.3) examines what can be expected from a discrete residual minimization principle if no connection to a CLSP class is assumed. This stage not only helps to explain the remarkable robustness of LSFEMs, but also reveals the limitations of this very general setting. In the second stage, the analysis is extended to include DLSPs obtained from a CLSP class associated with the PDE problem. In Section 3.4, we examine the transformation of a CLSP into a DLSP and show that this process consists of choosing approximate norm-generating and differential operators.2 In Section 3.5, the three basic types of DLSPs, e.g., compliant, norm-equivalent, and quasi-norm-equivalent, are shown to result from specific approximation choices. Using the link between CLSPs and DLSPs, we develop there an approximation theory for least-square finite element approximations of solutions of PDE problems.


Truncation Error Residual Energy Energy Norm Mathematical Foundation Auxiliary Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York 2009

Authors and Affiliations

  1. 1.Sandia National LaboratoriesApplied Mathematics and Applications MS 1320AlbuquerqueUSA
  2. 2.Florida State UniversityDepartment of Scientific ComputingTallahasseeUSA

Personalised recommendations