We present an elegant algorithm for stably and quickly generating the weights of Fejér's quadrature rules and of the Clenshaw-Curtis rule. The weights for an arbitrary number of nodes are obtained as the discrete Fourier transform of an explicitly defined vector of rational or algebraic numbers. Since these rules have the capability of forming nested families, some of them have gained renewed interest in connection with quadrature over multi-dimensional region
In classical multivariate quadrature with product rules it is natural to select an appropriate one-d...
The Clenshaw Curtis method for numerical integration is extended to semi-infinite ([_0, 30] and infi...
AbstractGauss-type quadrature rules with one or two prescribed nodes are well known and are commonly...
The main purpose of this paper is to compute the weights of Clenshaw-Curtis and Fejér type quadratur...
We present a method to construct a rational generalization of Fejér's quadrature rule. Compared to s...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
A novel mathematical framework is derived for the addition of nodes to univariate and interpolatory ...
A novel mathematical framework is derived for the addition of nodes to interpolatory quadrature rule...
The main purpose of this paper is to compute the weights of Clenshaw–Curtis and Fejér type quadratu...
Chebfun is a Matlab-based software system that overloads Matlab’s discrete operations for vectors an...
This paper deals with efficient quadrature formulas involving functions that are observed only at fi...
AbstractNewton–Cotes quadrature rules are based on polynomial interpolation in a set of equidistant ...
Working paper submitted to arxiv.org by authorsWe present several new quadrature formulas in the tri...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
Gauss quadrature points are not nested so search for quadrature rules with nested points and similar...
In classical multivariate quadrature with product rules it is natural to select an appropriate one-d...
The Clenshaw Curtis method for numerical integration is extended to semi-infinite ([_0, 30] and infi...
AbstractGauss-type quadrature rules with one or two prescribed nodes are well known and are commonly...
The main purpose of this paper is to compute the weights of Clenshaw-Curtis and Fejér type quadratur...
We present a method to construct a rational generalization of Fejér's quadrature rule. Compared to s...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
A novel mathematical framework is derived for the addition of nodes to univariate and interpolatory ...
A novel mathematical framework is derived for the addition of nodes to interpolatory quadrature rule...
The main purpose of this paper is to compute the weights of Clenshaw–Curtis and Fejér type quadratu...
Chebfun is a Matlab-based software system that overloads Matlab’s discrete operations for vectors an...
This paper deals with efficient quadrature formulas involving functions that are observed only at fi...
AbstractNewton–Cotes quadrature rules are based on polynomial interpolation in a set of equidistant ...
Working paper submitted to arxiv.org by authorsWe present several new quadrature formulas in the tri...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
Gauss quadrature points are not nested so search for quadrature rules with nested points and similar...
In classical multivariate quadrature with product rules it is natural to select an appropriate one-d...
The Clenshaw Curtis method for numerical integration is extended to semi-infinite ([_0, 30] and infi...
AbstractGauss-type quadrature rules with one or two prescribed nodes are well known and are commonly...