Bounds for the number of nodes in Chebyshev type quadrature formulas

DOI10.1016/0021-9045(91)90018-6zbMath0751.41026OpenAlexW2043345117MaRDI QIDQ1185536

Patrick Rabau

Publication date: 28 June 1992

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(91)90018-6

zbMATH Keywords

Chebyshev type quadrature formulas

Mathematics Subject Classification ID

Approximate quadratures (41A55)

Related Items (14)

Design theory from the viewpoint of algebraic combinatorics ⋮ A new approach to the construction of optimal designs ⋮ New spherical \((2 s + 1)\)-designs from Kuperberg's set: an experimental result ⋮ Explicit spherical designs ⋮ Chebyshev-type quadrature for Jacobi weight functions ⋮ Explicit construction of exact unitary designs ⋮ Spherical faraday cage for the case of equal point charges and chebyshev-type quadrature on the sphere ⋮ Simple universal bounds for Chebyshev-type quadratures ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ Isometric embeddings between classical Banach spaces, cubature formulas, and spherical designs ⋮ Chebyshev-type quadratures for doubling weights ⋮ Worst-case errors in a Sobolev space setting for cubature over the sphere S² ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ The minimal number of nodes in Chebyshev type quadrature formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalized mean-value theorem
• Averaging sets: A generalization of mean values and spherical designs
• Construction of spherical \(t\)-designs
• Sulle formule di quadratura di Tschebyscheff
• Spherical codes and designs
• A variation of the Tchebicheff quadrature problem
• Inequalities for the Derivatives of Polynomials

This page was built for publication: Bounds for the number of nodes in Chebyshev type quadrature formulas