Attributes  Values 

rdfs:label
  Clenshaw–Curtis quadrature

rdfs:comment
  Clenshaw–Curtis quadrature and Fejér quadrature are methods for numerical integration, or "quadrature", that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables Briefly, the function to be integrated is evaluated at the extrema or roots of a Chebyshev polynomial and these values are used to construct a polynomial approximation for the function. This polynomial is then integrated exactly. In practice, the integration weights for the value of the function at each node are precomputed, and this computation can be performed in

sameAs
 
dct:subject
 
Wikipage page ID
 
Wikipage revision ID
 
Link from a Wikipage to another Wikipage
 
foaf:isPrimaryTopicOf
 
prov:wasDerivedFrom
 
has abstract
  Clenshaw–Curtis quadrature and Fejér quadrature are methods for numerical integration, or "quadrature", that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables and use a discrete cosine transform (DCT) approximation for the cosine series. Besides having fastconverging accuracy comparable to Gaussian quadrature rules, Clenshaw–Curtis quadrature naturally leads to nested quadrature rules (where different accuracy orders share points), which is important for both adaptive quadrature and multidimensional quadrature (cubature). Briefly, the function to be integrated is evaluated at the extrema or roots of a Chebyshev polynomial and these values are used to construct a polynomial approximation for the function. This polynomial is then integrated exactly. In practice, the integration weights for the value of the function at each node are precomputed, and this computation can be performed in time by means of fast Fourier transformrelated algorithms for the DCT.

http://purl.org/voc/vrank#hasRank
 
is sameAs
of  
is Link from a Wikipage to another Wikipage
of  
is Wikipage redirect
of  
is foaf:primaryTopic
of  