Gauss–Legendre Collocation

Updated 3 June 2026

Gauss–Legendre Collocation is a high-order spectral discretization method that uses the roots of Legendre polynomials to achieve accurate approximations in differential equations and optimal control problems.
It exploits exact quadrature, diagonal mass matrices, and generalized summation-by-parts operators to ensure numerical stability and exponential convergence in challenging applications.
The method underpins modern high-order DG schemes, symplectic Hamiltonian integrators, and fractional problem solvers, offering precise error control and efficient implementation.

Gauss–Legendre Collocation is a high-order spectral discretization strategy that exploits the properties of Legendre polynomial roots (the Gauss–Legendre nodes) for accurate, stable approximation of solutions to ODEs, PDEs, optimal control problems, and integral equations. The method is underpinned by exact quadrature properties, diagonal mass matrices, generalized summation-by-parts (SBP) operators, and strong connections to symplectic time integrators and entropy stability. Gauss–Legendre collocation forms the foundation of efficient and accurate schemes for nonlinear conservation laws, high-order discontinuous Galerkin (DG) methods, and direct collocation in trajectory optimization, and has well-quantified error and convergence properties.

1. Definition and Key Algebraic Structures

Gauss–Legendre collocation relies on collocation at the roots of the Legendre polynomial $P_N(x)$ in $(-1,1)$ , denoted $\{x_i\}_{i=1}^N$ . These nodes, together with their positive quadrature weights $\{w_i\}_{i=1}^N$ , satisfy

$\int_{-1}^{1} f(x)\,dx = \sum_{i=1}^N w_i\,f(x_i)$

for all polynomials $f$ of degree $\le 2N-1$ (Rueda-Ramírez et al., 2022, Chan et al., 2018, Yousefi et al., 2018).

Lagrange interpolation uses basis polynomials $\ell_j(x)$ : $\ell_j(x) = \prod_{\substack{1\le i\le N \ i\neq j}} \frac{x-x_i}{x_j-x_i}$ which interpolate data at the nodes. This generates an interpolation operator and a discrete derivative (differentiation) matrix,

$D_{ij} = \ell_j'(x_i)$

so that, for nodal values $(-1,1)$ 0,

$(-1,1)$ 1

(Rueda-Ramírez et al., 2022, Chan et al., 2018, Brugnano et al., 2013).

The mass matrix $(-1,1)$ 2, and the differentiation matrix $(-1,1)$ 3, together satisfy a generalized summation-by-parts (SBP) property,

$(-1,1)$ 4

with $(-1,1)$ 5, $(-1,1)$ 6, $(-1,1)$ 7 otherwise; equivalently, $(-1,1)$ 8 (Rueda-Ramírez et al., 2022, Chan et al., 2018).

2. Applications in Discontinuous Galerkin and Spectral Element Methods

Gauss–Legendre collocation underpins discontinuous Galerkin spectral element methods (DGSEM) with volume nodes at Gauss points, exploiting the diagonal mass matrix and high quadrature accuracy.

The elementwise semidiscrete DGSEM collocation for a conservative law

$(-1,1)$ 9

is, at node $\{x_i\}_{i=1}^N$ 0,

$\{x_i\}_{i=1}^N$ 1

where $\{x_i\}_{i=1}^N$ 2, $\{x_i\}_{i=1}^N$ 3, the $\{x_i\}_{i=1}^N$ 4 are symmetric, consistent two-point volume fluxes, and face fluxes use entropy projections (Rueda-Ramírez et al., 2022, Chan et al., 2018, Schwarz et al., 31 Mar 2025).

Entropy-stable extensions are constructed via entropy-conservative volume and surface fluxes satisfying the Tadmor condition, with dissipation at interfaces to enforce entropy inequalities. The SBP property is essential for discrete entropy conservation (Rueda-Ramírez et al., 2022, Chan et al., 2018, Schwarz et al., 31 Mar 2025).

On curvilinear meshes, Jacobian and metric terms are embedded via isoparametric mappings, and discrete metric identities must be enforced for free-stream preservation and entropy stability, as in hexahedral elements (Rueda-Ramírez et al., 2022).

3. Comparison with Legendre–Gauss–Lobatto Collocation and Numerical Performance

Gauss–Legendre collocation (Gauss) contrasts with Legendre–Gauss–Lobatto (LGL) collocation in several aspects:

Degree of precision: Gauss quadrature integrates to degree $\{x_i\}_{i=1}^N$ 5 with $\{x_i\}_{i=1}^N$ 6 points; LGL integrates to the same degree with $\{x_i\}_{i=1}^N$ 7 points (endpoints included).
Mass matrix: Both have diagonal mass matrices under polynomial collocation.
SBP enforcement: LGL is “classical” since endpoints coincide with boundaries; Gauss SBP is “generalized” and requires face interpolation (Rueda-Ramírez et al., 2022, Chan et al., 2018, Schwarz et al., 31 Mar 2025).
Accuracy and efficiency: For a fixed number of degrees of freedom, Gauss-based schemes achieve lower error constants than LGL, especially on curved or non-affine meshes. Gauss schemes have a more severe timestep restriction but outperform LGL in terms of error per computational cost for prescribed accuracy (Rueda-Ramírez et al., 2022, Schwarz et al., 31 Mar 2025, Chan et al., 2018).

On highly distorted or curved meshes, Gauss–Legendre collocation avoids loss of convergence order that may occur with LGL points due to under-integration of geometric terms (Chan et al., 2018).

4. Extensions: Optimal Control, Hamiltonian Integration, and Fractional Problems

Gauss–Legendre collocation is a cornerstone of pseudospectral and direct collocation methods in optimal control. The approach transcribes the continuous OCP into a finite-dimensional NLP using the differentiation matrix, quadrature, and boundary constraints. Key features include:

Exponential convergence for analytic solutions in the sup-norm, as established in optimal control theory (Hager et al., 2015, Abadia-Doyle et al., 2024).
Modified Gauss–Legendre collocation for nonsmooth/bang–bang optimal control introduces switch-time variables, extra control variables at endpoints, and additional collocation equations to accurately locate discontinuities (Abadia-Doyle et al., 2024).
Second-order trajectory optimization uses a Gauss–Legendre pseudospectral discretization that maintains consistency between states and their derivatives at collocated points, crucial in robotic and mechanical systems (Moreno-Martín et al., 2023).

Hamiltonian problems: The Gauss–Legendre collocation scheme corresponds to the classical Gauss Runge–Kutta methods, having order $\{x_i\}_{i=1}^N$ 8 for $\{x_i\}_{i=1}^N$ 9 nodes, perfect A-stability, and symplecticity. These conserve quadratic invariants exactly and preserve energy to high accuracy for low-degree polynomial Hamiltonians. Energy-preserving symplectic perturbations and extensions (HBVMs) further exploit the collocation structure (Brugnano et al., 2010, Brugnano et al., 2010, Brugnano et al., 2013).

Fractional and B-spline collocation: Gauss–Legendre collocation is also employed to solve fractional integral equations with exponential convergence in $\{w_i\}_{i=1}^N$ 0, and for Schrödinger-type boundary value and eigenvalue problems, where it excels—provided the function can be well resolved by the chosen basis (Yousefi et al., 2018, Salas, 2020).

5. Superconvergence, Error Analysis, and Implementation

Superconvergence phenomena are documented in various contexts:

1D elliptic problems: The $\{w_i\}_{i=1}^N$ 1 Gauss collocation method achieves solution and derivative errors of order $\{w_i\}_{i=1}^N$ 2 at all mesh nodes for degree $\{w_i\}_{i=1}^N$ 3. At selected internal Jacobi or Lobatto nodes, higher pointwise superconvergence rates are proved (Cao et al., 2020).
DG and spectral element methods: Both theoretical and numerical results show spectral (exponential) accuracy for smooth problems, and favorable convergence constants for Gauss–Legendre over equispaced or nonlinearly distributed points (Brugnano et al., 2010, Chan et al., 2018, Schwarz et al., 31 Mar 2025).

Implementation leverages the structure of the differentiation matrix, diagonal mass matrix, and sparsity. Efficient splitting strategies for Newton-type solvers in Runge–Kutta or collocation context exploit the block structure of the Butcher matrix in Gauss–Legendre schemes and HBVMs (Brugnano et al., 2013).

6. Influence on High-Order PDE Discretization and Modern Research

Gauss–Legendre collocation undergirds cutting-edge research in entropy-stable high-order DG methods for compressible turbulence and MHD:

Entropy-stable DGSEM built on Gauss nodes yields higher accuracy per degree of freedom than LGL-based methods for compressible turbulence, with sharper shock-capturing and reduced dissipation (Schwarz et al., 31 Mar 2025, Rueda-Ramírez et al., 2022).
Stabilization techniques: Convex FV/DG blending and entropy-conservative/splitting form discretizations harness the SBP properties of Gauss collocation for robust high-order simulation of wall-bounded and separated flows (Schwarz et al., 31 Mar 2025).
SBP operators on Gauss nodes are portable to tensor-product elements in multiple dimensions, enabling robust, accurate methods for curved geometries with discrete geometric conservation (Chan et al., 2018, Rueda-Ramírez et al., 2022).

Gauss–Legendre collocation is pivotal for contemporary high-order numerical PDE and optimal control solvers, with ongoing development in generalized SBP operators and adaptation to broader problem classes.

References: