We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...

We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...

This paper examines the relationship between the degree of uniformity of distribution of grids, including Smolyak grids, with the intention of choosing weights to obtain efficient quadrature formulas.

Consider a hermitian positive-definite linear functional F, and assume we have m distinct nodes fixed in advance anywhere on the real line. In this paper we then study the existence and construction of nth rational Gauss-Radau (m = 1) and Gauss-Lobatto (m = 2) quadrature formulas that approximate F{f}. These are quadrature formulas with n positive weights and with the n−m remaining nodes real a...

We show how to combine incidence matrices, which admit Hermite-Birkhoff quadrature formulas of Gaussian type for any positive measure, in such a way that the resulting matrix also admits Gaussian type quadratures for any positive measure. Moreover, the uniqueness property and the extremal property of the formulas corresponding to the submatrices are transferred to the formula admitted by the co...