{
  "id": "chebyshev-quadrature",
  "title": "Chebyshev Quadrature",
  "lang": "en",
  "source_lang": "en",
  "summary": "Chebyshev quadrature denotes equal-weight numerical integration rules and, in another common usage, Gaussian quadrature associated with Chebyshev polynomials.",
  "category": "mathematics",
  "subcategory": "applied",
  "type": "concept",
  "aliases": [
    "Chebyshev-type quadrature",
    "Tchebycheff quadrature"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/chebyshev-quadrature/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/chebyshev-quadrature/",
      "json": "https://aiwiki.page/zh/chebyshev-quadrature.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Chebyshev quadrature is a term used in numerical analysis for quadrature formulas that approximate an integral by equally weighted function values. In a related but distinct usage, it denotes Gauss–Chebyshev quadrature, a Gaussian integration rule for particular weight functions associated with Chebyshev polynomials. These meanings overlap for the first-kind Chebyshev weight, whose Gaussian quadrature formula has equal weights, but they are not interchangeable in general."
    },
    {
      "heading": "Equal-weight quadrature",
      "text": "Let \\(\\mu\\) be a positive measure on an interval \\([a,b]\\), with finite total mass\n\n\\[M=\\int_a^b d\\mu(x)>0.\\]\n\nAn \\(n\\)-node equal-weight quadrature formula has the form\n\n\\[\\int_a^b f(x)\\,d\\mu(x) \\approx \\frac{M}{n}\\sum_{j=1}^{n}f(x_j), \\qquad x_j\\in[a,b].\\]\n\nThe points \\(x_j\\) are called nodes. Unlike a general quadrature rule, which allows a separate weight at every node, this formula fixes all weights at \\(M/n\\). The nodes are chosen to make the formula exact for a specified class of functions, usually polynomials.\n\nThe rule has algebraic degree of exactness \\(m\\) if it integrates every polynomial of degree at most \\(m\\) exactly but fails for at least one polynomial of degree \\(m+1\\). Some existence results instead state only that the degree is at least \\(m\\).\n\nEqual weights do not mean equally spaced nodes. The equality concerns the coefficients multiplying the function values, not the distances between sampling points.\n\nMoment conditions\n\nExactness through degree \\(m\\) is equivalent to\n\n\\[\\frac{1}{n}\\sum_{j=1}^{n}x_j^k = \\frac{1}{M}\\int_a^b x^k\\,d\\mu(x), \\qquad k=0,1,\\ldots,m.\\]\n\nThe equation for \\(k=0\\) holds automatically. The other equations require the discrete distribution on the nodes to reproduce the first \\(m\\) moments of the normalized measure.\n\nFor ordinary integration on \\([-1,1]\\), these conditions become\n\n\\[\\frac{1}{n}\\sum_{j=1}^{n}x_j^k = \\begin{cases} 0, & k\\text{ odd},\\\\[2mm] \\dfrac{1}{k+1}, & k\\text{ even}. \\end{cases}\\]\n\nThey form a nonlinear system of equations in the node coordinates—not a linear system, despite each condition being a sum of powers. Symmetric node sets automatically satisfy all the odd-moment equations.\n\nFor example,\n\n\\[\\int_{-1}^{1}f(x)\\,dx \\approx f\\!\\left(-\\frac{1}{\\sqrt3}\\right) + f\\!\\left(\\frac{1}{\\sqrt3}\\right)\\]\n\nis an equal-weight rule exact through degree \\(3\\). It is also the two-node Gauss–Legendre rule."
    },
    {
      "heading": "Relation to Gaussian quadrature",
      "text": "A general \\(n\\)-node quadrature formula has the form\n\n\\[Q_n(f)=\\sum_{j=1}^{n}w_jf(x_j).\\]\n\nFor a positive measure with sufficiently rich support and finite moments, Gaussian quadrature chooses both the nodes and the weights to achieve degree \\(2n-1\\). Its nodes are the zeros of the degree-\\(n\\) member of the corresponding family of orthogonal polynomials.\n\nEqual-weight quadrature imposes the extra restrictions\n\n\\[w_1=\\cdots=w_n=\\frac{M}{n}.\\]\n\nConsequently, it generally cannot achieve Gaussian exactness with the same number of nodes. Finding a rule becomes an existence and node-placement problem rather than simply computing the usual Gaussian nodes.\n\nThe upper bound on polynomial exactness can be understood directly. For any \\(n\\) distinct nodes, define\n\n\\[p(x)=\\prod_{j=1}^{n}(x-x_j)^2.\\]\n\nThis polynomial has degree \\(2n\\), is nonnegative, and vanishes at every node. Thus \\(Q_n(p)=0\\), whereas its integral is positive whenever the measure is not concentrated on those nodes. No such rule can then be exact for all polynomials of degree \\(2n\\).\n\nIn the equal-weight literature, a central question is therefore: for a specified measure and target degree \\(m\\), how many nodes are needed? The answer depends strongly on the measure. Formulations also differ over whether repeated nodes are permitted."
    },
    {
      "heading": "Gauss–Chebyshev quadrature of the first kind",
      "text": "The most familiar explicit Chebyshev rule concerns\n\n\\[I(f)=\\int_{-1}^{1}\\frac{f(x)}{\\sqrt{1-x^2}}\\,dx.\\]\n\nIts weight function is\n\n\\[w(x)=\\frac{1}{\\sqrt{1-x^2}}.\\]\n\nThe Chebyshev polynomials of the first kind satisfy\n\n\\[T_n(\\cos\\theta)=\\cos(n\\theta).\\]\n\nTheir zeros give the quadrature nodes:\n\n\\[x_j=\\cos\\left(\\frac{(2j-1)\\pi}{2n}\\right), \\qquad j=1,\\ldots,n.\\]\n\nAll quadrature weights are equal:\n\n\\[\\boxed{ \\int_{-1}^{1}\\frac{f(x)}{\\sqrt{1-x^2}}\\,dx \\approx \\frac{\\pi}{n}\\sum_{j=1}^{n} f\\!\\left(\\cos\\frac{(2j-1)\\pi}{2n}\\right) }.\\]\n\nThis formula is exact for every polynomial \\(f\\) of degree at most \\(2n-1\\). It is therefore both a Gaussian rule and an equal-weight rule.\n\nAngular interpretation\n\nThe substitution \\(x=\\cos\\theta\\) gives\n\n\\[I(f)=\\int_0^\\pi f(\\cos\\theta)\\,d\\theta.\\]\n\nThe angular nodes\n\n\\[\\theta_j=\\frac{(2j-1)\\pi}{2n}\\]\n\nare the midpoints of \\(n\\) equal subintervals of \\([0,\\pi]\\). Thus the rule is a midpoint rule in the angular variable, although its \\(x\\)-nodes are not equally spaced: they cluster near \\(-1\\) and \\(1\\).\n\nPolynomial exactness can also be seen through the cosine representation of the Chebyshev polynomials. The equal-angle sum reproduces their weighted integrals through degree \\(2n-1\\).\n\nError formula\n\nIf \\(f\\) has a continuous derivative of order \\(2n\\) on \\([-1,1]\\), then for some \\(\\xi\\in(-1,1)\\),\n\n\\[I(f)-Q_n(f) = \\frac{\\pi}{2^{2n-1}(2n)!}\\, f^{(2n)}(\\xi).\\]\n\nHere \\((2n)!\\) denotes a factorial.\n\nThis is a theoretical remainder formula, not generally a directly computable error estimate: the point \\(\\xi\\) is unknown. For smooth functions, convergence can be rapid; for functions with limited regularity or additional singularities, convergence may be substantially slower."
    },
    {
      "heading": "Second-kind Gauss–Chebyshev quadrature",
      "text": "A related Gaussian rule uses the weight\n\n\\[w(x)=\\sqrt{1-x^2}.\\]\n\nIts nodes are the zeros of the second-kind Chebyshev polynomial \\(U_n\\):\n\n\\[x_j=\\cos\\left(\\frac{j\\pi}{n+1}\\right), \\qquad j=1,\\ldots,n.\\]\n\nThe formula is\n\n\\[\\int_{-1}^{1}f(x)\\sqrt{1-x^2}\\,dx \\approx \\frac{\\pi}{n+1} \\sum_{j=1}^{n} \\sin^2\\left(\\frac{j\\pi}{n+1}\\right) f\\!\\left(\\cos\\frac{j\\pi}{n+1}\\right).\\]\n\nIt is also exact through degree \\(2n-1\\), but its weights are generally unequal. Thus a rule called “Gauss–Chebyshev quadrature” need not be Chebyshev quadrature in the strict equal-weight sense."
    },
    {
      "heading": "Interpretation and applications",
      "text": "If \\(\\mu\\) is normalized to a probability distribution, an equal-weight quadrature formula approximates an expected value by an arithmetic average:\n\n\\[\\mathbb E[f(X)] \\approx \\frac{1}{n}\\sum_{j=1}^{n}f(x_j).\\]\n\nUnlike ordinary Monte Carlo integration, its nodes are selected deterministically to satisfy exactness conditions rather than generated as independent random samples.\n\nFirst-kind Gauss–Chebyshev quadrature is especially convenient when the integral already contains the inverse-square-root endpoint weight. It is also useful in computations involving Chebyshev expansions and approximation theory, because its nodes and weights have explicit formulas.\n\nThe weight must nevertheless match the problem. Applying the first-kind formula directly to \\(f\\) does not approximate the unweighted integral \\(\\int_{-1}^{1}f(x)\\,dx\\). Although that integral can be rewritten as\n\n\\[\\int_{-1}^{1}f(x)\\,dx = \\int_{-1}^{1} \\frac{f(x)\\sqrt{1-x^2}}{\\sqrt{1-x^2}}\\,dx,\\]\n\nthe transformed numerator may lose endpoint smoothness. Consequently, the high polynomial exactness of the weighted rule does not automatically imply equally favorable performance for an unweighted integral."
    }
  ],
  "links": [
    "numerical-analysis",
    "integral",
    "polynomial",
    "system-of-linear-equations",
    "orthogonal-polynomials",
    "chebyshev-polynomials",
    "factorial",
    "probability-distribution",
    "expected-value",
    "monte-carlo-method"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}