A simple proof of coerciveness of first-order system least-squares methods for general second-order elliptic PDEs

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations


Related Research Unit(s)


Original languageEnglish
Pages (from-to)98-104
Journal / PublicationComputers and Mathematics with Applications
Online published1 Dec 2022
Publication statusPublished - 15 Jan 2023


In this paper, we present a simple proof of the coerciveness of first-order system least-squares methods for general (possibly indefinite) second-order linear elliptic PDEs under a minimal uniqueness assumption. The proof is inspired by Ku's proof [36] based on the a priori estimate of the PDE. For general linear second-order elliptic PDEs, the uniqueness, existence, and well-posedness are equivalent due to the compactness of the operator and Fredholm alternative. Thus only a minimal uniqueness assumption is assumed: the homogeneous equation has a unique zero solution. The proof presented in the paper is a straightforward and short proof using the inf-sup stability of the standard variational formulation. The proof can potentially be applied to other equations or settings once having the standard formulation's stability. As an application, we also discuss least-squares finite element methods for problems with a nonsingular H−1 right-hand side.

Research Area(s)

  • Coerciveness, General second-order elliptic PDEs, Least-squares methods, LSFEM