English
Related papers

Related papers: Approximation by orthonormal polynomials associate…

200 papers

This paper delves into classical multiple orthogonal polynomials with an arbitrary number of weights, including Jacobi-Pi\~neiro, Laguerre of both first and second kinds, as well as multiple orthogonal Hermite polynomials. Novel explicit…

Classical Analysis and ODEs · Mathematics 2024-04-24 Amílcar Branquinho , Juan EF Díaz , Ana Foulquié-Moreno , Manuel Mañas

This paper shows that there is a correspondence between quasi-exactly solvable models in quantum mechanics and sets of orthogonal polynomials $\{ P_n\}$. The quantum-mechanical wave function is the generating function for the $P_n (E)$,…

High Energy Physics - Theory · Physics 2009-10-28 Carl M. Bender , Gerald V. Dunne

In this article, we construct new Pad\'{e} approximations for the \emph{product} of binomial functions and powers of logarithmic functions. While several explicit Pad\'{e} approximants are known for powers of exponential functions, binomial…

Number Theory · Mathematics 2025-11-14 Makoto Kawashima

New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…

Classical Analysis and ODEs · Mathematics 2019-12-05 Semyon Yakubovich

Asymptotic behavior of orthogonal polynomials on the circle, with respect to a weight having a fractional zero on the torus. Applications to the eigenvalues of certain unitary random matrices. This paper is devoted to the orthogonal…

Functional Analysis · Mathematics 2009-04-27 Philippe Rambour , Abdellatif Seghier

We consider polynomials orthogonal on $[0,\infty)$ with respect to Laguerre-type weights $w(x)=x^\alpha e^{-Q(x)}$, where $\alpha>-1$ and where $Q$ denotes a polynomial with positive leading coefficient. The main purpose of this paper is to…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. Vanlessen

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

Number Theory · Mathematics 2016-07-26 Nour-Eddine Fahssi

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

Machine Learning · Statistics 2012-03-27 Péter Kövesárki

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…

Symbolic Computation · Computer Science 2019-04-16 Adam Strzeboński

We apply the technique of self-similar exponential approximants based on successive truncations of continued exponentials to reconstruct functional laws of the quasi-exponential class from the knowledge of only a few terms of their power…

Condensed Matter · Physics 2009-11-07 S. Gluzman , D. Sornette , V. I. Yukalov

We examine a special linear combination of balanced very-well-poised $\tphia$ basic hypergeometric series that is known to satisfy a transformation. We call this $\Phi$ and show that it satisfies certain three-term contiguous relations.…

Classical Analysis and ODEs · Mathematics 2016-09-06 Dharma P. Gupta , David R. Masson

For a family of polynomials in two continuous variables, orthogonal with respect to a weight function, we prove, under suitable conditions, the equivalence of the following properties: the matrix Pearson equation of the weight, the second…

Classical Analysis and ODEs · Mathematics 2026-05-20 Maurice Kenfack Nangho , Kerstin Jordaan , Bleriod Jiejip Nkwamouo

The exponential orthogonal polynomials encode via the theory of hyponormal operators a shade function $g$ supported by a bounded planar shape. We prove under natural regularity assumptions that these complex polynomials satisfy a three term…

Spectral Theory · Mathematics 2019-02-05 Bjorn Gustafsson , Mihai Putinar

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…

Classical Analysis and ODEs · Mathematics 2018-01-17 Michael Revers

In this paper, we propose a method to obtain a constrained approximation of a rational B\'{e}zier curve by a polynomial B\'{e}zier curve. This problem is reformulated as an approximation problem between two polynomial B\'{e}zier curves…

Numerical Analysis · Mathematics 2014-09-16 Mao Shi , Jiansong Deng

We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients. It is stated in terms of moduli of smoothness. In particular, it yields a big $O$-characterization…

Classical Analysis and ODEs · Mathematics 2020-09-17 Borislav R. Draganov

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

In this work, we study convergence in probability and almost sure convergence for weighted partial sums of random variables that are related to the class of generalized Oppenheim expansions. It is worth noting that the random variables…

Probability · Mathematics 2022-07-21 Rita Giuliano , Milto Hadjikyriakou

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

Mathematical Software · Computer Science 2007-05-23 Nicolas Brisebarre , Jean-Michel Muller