A saddle point least squares approach for primal mixed formulations of second order PDEs

Abstract

We present a Saddle Point Least Squares (SPLS) method for discretizing second order elliptic problems written as primal mixed variational formulations. A stability LBB condition and a data compatibility condition at the continuous level are automatically satisfied. The proposed discretization method follows a general SPLS approach and has the advantage that a discrete inf–sup condition is automatically satisfied for standard choices of the test and trial spaces. For the proposed iterative processes a nodal basis for the trial space is not required. Efficient preconditioning techniques that involve inversion only on the test space can be considered. Stability and approximation properties for two choices of discrete spaces are investigated. Applications of the new approach include discretization of second order problems with highly oscillatory coefficient, interface problems, and higher order approximation of the flux for elliptic problems with smooth coefficients.