Gauss–Jacobi Quadrature¶

An n-node Gaussian rule for the Jacobi weight (1-x)^alpha(1+x)beta on [-1,1], using roots of the degree-n Jacobi polynomial and integrating weighted polynomials through degree 2n-1 exactly.

Version: v2 · 2026-09-19 · History
Domain-specific #: 1916
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Numerical Analysis, Gaussian Quadrature and Orthogonal Polynomials → Mathematics
Aliases: Gauss-Jacobi quadrature, Gaussian–Jacobi quadrature, Gauss–Jacobi rule

Core Idea¶

Gauss–Jacobi quadrature is the Gaussian integration rule adapted to the Jacobi weight

\[ w_{\alpha,\beta}(x)=(1-x)^\alpha(1+x)^\beta, \qquad -1<x<1, \qquad \alpha,\beta>-1. \]

For a positive integer n, it replaces the weighted integral

\[ I_{\alpha,\beta}[f] =\int_{-1}^{1} f(x)w_{\alpha,\beta}(x)\,dx \]

by a finite sum

\[ Q_n[f]=\sum_{i=1}^{n}\lambda_i f(x_i). \]

The nodes x_i are the n roots of the degree-n Jacobi polynomial P_n^{(\alpha,\beta)}, and the weights \lambda_i are positive. This choice makes the rule exact whenever f is a polynomial of degree at most 2n-1. The rule is therefore not merely a weighted sampling convention.

How would you explain it like I'm…

Clever Few-Spots Adding

Imagine you want to know how much paint covers a strip, but in this strip some places count more than others, especially near the two ends. Instead of checking every spot, you check just a few very cleverly chosen spots. You give each spot its own amount of importance and add them up. For lots of smooth shapes, those few clever spots give exactly the right answer.

Few-Point Perfect Area Trick

Gauss–Jacobi Quadrature is a trick for finding the area under a curve between −1 and 1 using only a few sample points. The area is 'weighted,' meaning some places count more or less, and the weight is controlled by two numbers, one for each end. The method picks special sample points and special positive multipliers for them. With n points, it gets the exact answer for any polynomial curve up to degree 2n−1, which is the best possible with n points.

Jacobi-Weighted Gaussian Integration

Gauss–Jacobi Quadrature approximates the weighted integral of f(x)(1−x)^α(1+x)^β from −1 to 1, with α and β both greater than −1. It replaces the integral by a sum of n terms, λ_i f(x_i). The nodes x_i are the n roots of the degree-n Jacobi polynomial for that α and β, and the weights λ_i are all positive. This makes the rule exact for every polynomial of degree up to 2n−1, the highest possible for n points. α controls the weight's behavior at x = 1 and β at x = −1: negative values let you absorb certain endpoint blow-ups into the weight, while positive values push the endpoints down. If α or β equals −1, the weight can't be integrated, so the standard rule no longer works.

Gauss–Jacobi Quadrature is the n-point Gaussian rule for the Jacobi weight w(x) = (1−x)^α(1+x)^β on (−1,1), with α, β > −1. It approximates ∫ f(x) w(x) dx by Q_n[f] = Σ λ_i f(x_i). The nodes are the n zeros of the Jacobi polynomial P_n^(α,β), which are orthogonal with respect to w, and the weights λ_i are positive. Because of this orthogonality, the rule integrates every polynomial of degree ≤ 2n−1 exactly — the maximal degree for n nodes. The constraints α, β > −1 are exactly what make w positive and integrable; α governs the right endpoint and β the left. Negative admissible exponents let integrable algebraic endpoint singularities be built into the weight, while positive exponents suppress the endpoints. At α = −1 or β = −1 the measure isn't integrable and the ordinary rule fails. Dropping the Jacobi weight gives generic Gaussian quadrature; dropping Gaussian optimality gives a general weighted rule.

Scope of Application¶

Gauss–Jacobi quadrature applies to finite-interval integration where a known algebraic endpoint profile can be made part of the measure. On [-1,1], \alpha<0 concentrates measure near x=1, and \beta<0 concentrates it near x=-1; positive values suppress the associated endpoint. This makes the rule useful for transformed boundary-integral kernels, special-function representations, spectral and finite-element calculations, probability integrals, and other computations with endpoint-weighted moments.

Clarity¶

The abstraction clarifies three questions that are often mixed together: what is being integrated, how the endpoints are represented, and how the finite rule is constructed. Writing I_{\alpha,\beta}[f] makes the measure explicit. Naming P_n^{(\alpha,\beta)} locks the same parameters into the orthogonality relation. Stating degree 2n-1 exactness tells the reader exactly what the n samples guarantee.

Manages Complexity¶

The rule compresses an infinite-dimensional integration operation into n function evaluations while exactly preserving 2n weighted moments. Matching the measure to known endpoint behavior moves predictable nonuniformity out of the residual integrand. The remaining function can be smoother, so a relatively small rule may capture information that an unweighted rule would spend many nodes resolving near an endpoint.

Abstract Reasoning¶

Gauss–Jacobi quadrature is best understood through orthogonality rather than a memorized weight formula. Suppose an n-node rule uses the roots of P_n^{(\alpha,\beta)}. Any polynomial p of degree at most 2n-1 can be divided as

\[ p(x)=q(x)P_n^{(\alpha,\beta)}(x)+r(x), \]

Knowledge Transfer¶

Several lessons transfer outward. First, put known singular or rapidly varying structure into a representation designed for it rather than asking a generic approximation to rediscover it. Second, use invariants for testing: root location, positivity, zeroth-moment conservation, and polynomial exactness are more diagnostic than comparing two implementations on one arbitrary function. Third, distinguish a mathematical object from its algorithmic realization; tridiagonal eigendecomposition and asymptotic root computation can produce the same rule.

Relationships to Other Abstractions¶

Current abstraction Gauss–Jacobi Quadrature Domain-specific

Parents (1) — outgoing typed relations

Gauss–Jacobi Quadrature is a kind of Approximation Prime

Gauss–Jacobi quadrature is a strict instance of Approximation.

Hierarchy path (1) — routes to 1 parentless root

Gauss–Jacobi Quadrature → is a kind of Approximation → is a decomposition of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Gauss–Jacobi Quadrature sits in a sparse region of the domain-specific corpus (86^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Numerical Root-Finding & Quadrature Methods (8 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25