Related papers: A unified framework for the computation of polynom…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
In this paper we obtain $L^1$-weighted norms of classical orthogonal polynomials (Hermite, Laguerre and Jacobi polynomials) in terms of the zeros of these orthogonal polynomials; these expressions are usually known as quadrature rules. In…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…
A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…
A novel mathematical framework is derived for the addition of nodes to univariate and interpolatory quadrature rules. The framework is based on the geometrical interpretation of the Vandermonde matrix describing the relation between the…
In this contribution we deal with Gaussian quadrature rules based on orthogonal polynomials associated with a weight function $w(x)= x^{\alpha} e^{-x}$ supported on an interval $(0,z)$, $z>0.$ The modified Chebyshev algorithm is used in…
A quadrature formula is a formula computing a definite integration by evaluation at finite points. The existence of certain quadrature formulas for orthogonal polynomials is related to interesting problems such as Waring's problem in number…
In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities…
An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.
By introducing a parameter, we give a unified generalization of some quadrature rules, which not only unify the recent results about error bounds for generalized mid-point, trapezoid and Simpson's rules, but also give some new error bounds…
The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…
This paper deals with the estimation of the quadrature error of a Gaussian formula for weight functions involving fractional powers, exponentials and Bessel functions of the first kind. For this purpose, in this work the averaged and…
A class of numerical quadrature rules is derived, with equally-spaced nodes, and unit weights except at a few points at each end of the series, for which "corrections" (not using any further information about the integrand) are added to the…
In order to approximate the integral $I(f)=\int_a^b f(x) dx$, where $f$ is a sufficiently smooth function, models for quadrature rules are developed using a given {\it panel} of $n (n\geq 2)$ equally spaced points. These models arise from…
A method of deriving quadrature rules has been developed which gives nodes and weights for a Gaussian-type rule which integrates functions of the form: f(x,y,t) = a(x,y,t)/((x-t)^2+y^2) + b(x,y,t)/([(x-t)^2+y^2]^{1/2}) +…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
A fast and accurate algorithm for the computation of Gauss-Hermite and generalized Gauss-Hermite quadrature nodes and weights is presented. The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and…
We provide explicit expressions for quadrature rules on the space of $C^1$ quintic splines with uniform knot sequences over finite domains. The quadrature nodes and weights are derived via an explicit recursion that avoids an intervention…
In this paper we describe a methodology for the identification of symmetric quadrature rules inside of quadrilaterals, triangles, tetrahedra, prisms, pyramids, and hexahedra. The methodology is free from manual intervention and is capable…
We introduce a new weight and corresponding metric over finite extension fields for asymmetric error correction. The weight distinguishes between elements from the base field and the ones outside of it, which is motivated by asymmetric…