Related papers: Approximation of Askey-Wilson roots
In this paper we describe two pairs of raising/lowering operators for Askey-Wilson polynomials, which result from constructions involving very different techniques. The first technique is quite elementary, and depends only on the…
We introduce three one-parameter semigroups of operators and determine their spectra. Two of them are fractional integrals associated with the Askey-Wilson operator. We also study these families as families of positive linear approximation…
The Askey-Wilson function transform is a q-analogue of the Jacobi function transform with kernel given by an explicit non-polynomial eigenfunction of the Askey-Wilson second order q-difference operator. The kernel is called the Askey-Wilson…
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
We obtain weight functions associated with $q$-linear and $q$-quadratic lattices that yield discrete orthogonality with respect to a quasi-definite moment functional for the Askey-Wilson polynomials and all the polynomial sequences in the…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…
We recall five families of polynomials constituting a part of the so-called Askey-Wilson scheme. We do this to expose properties of the Askey-Wilson (AW) polynomials that constitute the last, most complicated element of this scheme. In…
We study two families of orthogonal polynomials. The first is a finite family related to the Askey-Wilson polynomials but the orthogonality is on the real line. A limiting case of this family is an infinite system of orthogonal polynomials…
For a two parameter family of Askey-Wilson polynomials, that can be regarded as basic analogues of the Legendre polynomials, an addition formula is derived. The addition formula is a two-parameter extension of Koornwinder's addition formula…
This paper establishes expectation and variance asymptotics for statistics of the Poisson--Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include…
New formulas for the nth moment of the Askey-Wilson polynomials are given. These are derived using analytic techniques, and by considering three combinatorial models for the moments: Motzkin paths, matchings, and staircase tableaux. A…
In this chapter we characterize Askey-Wilson polynomials including specific and limiting cases of them by some structure relations of the first type.
Asymptotic approximations of Jacobi polynomials are given in terms of elementary functions for large degree $n$ and parameters $\alpha$ and $\beta$. From these new results, asymptotic expansions of the zeros are derived and methods are…
We propose a numerical analysis of a simplified version of the previous paper "Multiplicity hunting and approximating multiple roots of polynomial systems" written by the two authors.
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…