A least squares perspective of Green–Gauss gradient schemes

Abstract

The least squares and Green–Gauss gradient schemes have been traditionally studied as two distinct techniques for gradient computation on unstructured meshes in the literature. In this Letter, we show that the Green–Gauss gradient method can be interpreted as a weighted least squares gradient scheme and that methods of the Green–Gauss family may therefore be encompassed in the larger set of least squares-based gradient schemes.