AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval [-1, 1] recently established in [1], explicit expressions for the nodes and the weights of the Gaussian formulas associated with rational modifications of the Chebyshev weight functions, are given. Some illustrative numerical examples are also presented
AbstractA flexible treatment of Gaussian quadrature formulas based on rational functions is given to...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
AbstractClassical interpolatory or Gaussian quadrature formulas are exact on sets of polynomials. Th...
Several generalisations to the classical Gauss quadrature formulas have been made over the last few ...
AbstractIn this note, interpolatory quadrature formulas with nodes xj being the zeros of Tn(x) + C w...
In this paper, we consider the Gauss-Kronrod quadrature formulas for a modified Chebyshev weight. Ef...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
AbstractThis paper is concerned with the numerical integration of functions with poles near the inte...
We present a relation between rational Gauss-type quadrature formulas that approximate integrals of ...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev q...
AbstractA flexible treatment of Gaussian quadrature formulas based on rational functions is given to...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
AbstractClassical interpolatory or Gaussian quadrature formulas are exact on sets of polynomials. Th...
Several generalisations to the classical Gauss quadrature formulas have been made over the last few ...
AbstractIn this note, interpolatory quadrature formulas with nodes xj being the zeros of Tn(x) + C w...
In this paper, we consider the Gauss-Kronrod quadrature formulas for a modified Chebyshev weight. Ef...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
AbstractThis paper is concerned with the numerical integration of functions with poles near the inte...
We present a relation between rational Gauss-type quadrature formulas that approximate integrals of ...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev q...
AbstractA flexible treatment of Gaussian quadrature formulas based on rational functions is given to...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...