Related papers: Quadrature formulas for Bessel polynomials
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
The Al-Salam-Chihara polynomials are an important family of orthogonal polynomials in one variable $x$ depending on 3 parameters $\alpha$, $\beta$ and $q$. They are closely connected to a model from statistical mechanics called the…
We present a method to obtain weight functions associated with linear and quadratic lattices that yield discrete orthogonality with respect to a quasi-definite moment functional of the orthogonal polynomial sequences in the Askey scheme,…
In this article we consider certain types of weighted generalized functions associated with nondegenerate quadratic forms. Such functions and their derivatives are used for constructing fundamental solutions of iterated ultra-hyperbolic…
When integrating functions that have poles outside the interval of integration, but are regular otherwise, it is suggested that the quadrature rule in question ought to integrate exactly not only polynomials (if any), but also suitable…
Strong asymptotics of polynomials orthogonal on the unit circle with respect to a weight of the form $$ W(z) = w(z) \prod_{k=1}^m |z-a_k|^{2\beta_k}, \quad |z|=1, \quad |a_k|=1, \quad \beta_k>-1/2, \quad k=1, ..., m, $$ where $w(z)>0$ for…
The paper is devoted to the further study of the remarkable classes of orthogonal polynomials recently discovered by Bender and Dunne. We show that these polynomials can be generated by solutions of arbitrary quasi - exactly solvable…
The concept of Gauss quadrature can be generalized to approximate linear functionals with complex moments. Following the existing literature, this survey will revisit such generalization. It is well known that the (classical) Gauss…
The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…
This paper studies three different ways to assign weights to the lattice points of a convex polytope and discusses the algebraic and combinatorial properties of the resulting weighted Ehrhart functions and their generating functions and…
We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special $R_{II}$ recurrence relation. We also look into some methods for generating the nodes (which lie on…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
We study a quadrature, proposed by Ermakov and Zolotukhin in the sixties, through the lens of kernel methods. The nodes of this quadrature rule follow the distribution of a determinantal point process, while the weights are defined through…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…
We prove a general quadratic formula for basic hypergeometric series, from which simple proofs of several recent determinant and Pfaffian formulas are obtained. A special case of the quadratic formula is actually related to a Gram…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
In this paper, by introducing new matrix operations and using a specific inverse relation, we establish the dual forms of the orthogonality relations for some well-known discrete and continuous $q$-orthogonal polynomials from the…