DOIAbstract
We give here an n-point Chebyshev-type rule of algebraic degree of precision n - 1, but having nodes that can be given explicitly. This quadrature rule also turns out to be one with an ''almost'' highest algebraic degree of precision
We give here an n-point Chebyshev-type rule of algebraic degree of precision n - 1, but having nodes that can be given explicitly. This quadrature rule also turns out to be one with an ''almost'' highest algebraic degree of precision
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
AbstractIn this note, interpolatory quadrature formulas with nodes xj being the zeros of Tn(x) + C w...
This paper improves error bounds forGauss, Clenshaw-Curtis and Fejér's first quadrature by using new...
AbstractWe give here an n-point Chebyshev-type rule of algebraic degree of precision n − 1, but havi...
AbstractWe give here an n-point Chebyshev-type rule of algebraic degree of precision n − 1, but havi...
AbstractWe consider Chebyshev type quadrature formulas on an interval, i.e., quadrature formulas whe...
AbstractWe consider Chebyshev type quadrature formulas on an interval, i.e., quadrature formulas whe...
AbstractQuadrature formulas with equal coefficients for interval and circle are combined to obtain C...
AbstractQuadrature formulas with equal coefficients for interval and circle are combined to obtain C...
AbstractThe aim of this work is to construct a new quadrature formula based on the divided differenc...
AbstractWe consider interpolatory quadrature formulae, relative to the Legendre weight function on [...
AbstractWe give a sharp asymptotic bound on the number of nodes needed for Chebyshev-type (= equal w...
AbstractIn this paper we consider quadrature formulas which use the derivative of only an arbitrary ...
AbstractAn automatic, non-adaptive, quadrature schema is proposed, based on three different formulas...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
AbstractIn this note, interpolatory quadrature formulas with nodes xj being the zeros of Tn(x) + C w...
This paper improves error bounds forGauss, Clenshaw-Curtis and Fejér's first quadrature by using new...
AbstractWe give here an n-point Chebyshev-type rule of algebraic degree of precision n − 1, but havi...
AbstractWe give here an n-point Chebyshev-type rule of algebraic degree of precision n − 1, but havi...
AbstractWe consider Chebyshev type quadrature formulas on an interval, i.e., quadrature formulas whe...
AbstractWe consider Chebyshev type quadrature formulas on an interval, i.e., quadrature formulas whe...
AbstractQuadrature formulas with equal coefficients for interval and circle are combined to obtain C...
AbstractQuadrature formulas with equal coefficients for interval and circle are combined to obtain C...
AbstractThe aim of this work is to construct a new quadrature formula based on the divided differenc...
AbstractWe consider interpolatory quadrature formulae, relative to the Legendre weight function on [...
AbstractWe give a sharp asymptotic bound on the number of nodes needed for Chebyshev-type (= equal w...
AbstractIn this paper we consider quadrature formulas which use the derivative of only an arbitrary ...
AbstractAn automatic, non-adaptive, quadrature schema is proposed, based on three different formulas...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
AbstractIn this note, interpolatory quadrature formulas with nodes xj being the zeros of Tn(x) + C w...
This paper improves error bounds forGauss, Clenshaw-Curtis and Fejér's first quadrature by using new...
Add to ORKG