English
Related papers

Related papers: Localized polynomial frames on the interval with J…

200 papers

The main purpose of this paper is to introduce moduli of smoothness with Jacobi weights $(1-x)^\alpha(1+x)^\beta$ for functions in the Jacobi weighted $L_p[-1,1]$, $0<p\le \infty$, spaces. These moduli are used to characterize the…

Classical Analysis and ODEs · Mathematics 2018-11-12 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

For arbitrary $\beta > 0$, we use the orthogonal polynomials techniques developed by R. Killip and I. Nenciu to study certain linear statistics associated with the circular and Jacobi $\beta$ ensembles. We identify the distribution of these…

Probability · Mathematics 2009-11-13 E. Ryckman

We obtain sharp estimates for the Jacobi heat kernel in a range of parameters where the result has not been established before. This extends and completes an earlier result due to the authors. The proof is based on a generalization of the…

Classical Analysis and ODEs · Mathematics 2024-02-15 Adam Nowak , Peter Sjögren , Tomasz Z. Szarek

We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…

Optimization and Control · Mathematics 2020-07-13 Konstantin Usevich , Jianze Li , Pierre Comon

The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…

Numerical Analysis · Mathematics 2011-12-15 Marko Huhtanen , Allan Perämäki

Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…

solv-int · Physics 2015-06-26 M. Adler , P. J. Forrester , T. Nagao , P. van Moerbeke

In this paper we use the orthogonal system of the Jacobi polynomials as a tool to study the Riemann-Liouville fractional integral and derivative operators on a compact of the real axis.This approach has some advantages and allows us to…

Functional Analysis · Mathematics 2020-02-06 M. V. Kukushkin

The purpose of this article is to study operators whose kernel share some key features of Bergman kernels from complex analysis, and are approximate projectors. It turns out that they must be associated with a rich set of geometric data, on…

Complex Variables · Mathematics 2024-07-10 Yannick Guedes Bonthonneau

In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…

Classical Analysis and ODEs · Mathematics 2017-04-13 Sabrine Arfaoui , Anouar Ben Mabrouk

We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with…

Number Theory · Mathematics 2010-08-06 Christian Berg

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

Classical Analysis and ODEs · Mathematics 2010-02-11 I. Moale , P. Yuditskii

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…

Nuclear Theory · Physics 2009-10-30 B. D. Keister , W. N. Polyzou

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

Numerical Analysis · Mathematics 2025-08-26 Oleg Davydov

In this paper we study spectral properties of Jacobi operators. In particular, we prove two main results: (1) that perturbing the diagonal coefficients of Jacobi operator, in an appropriate sense, results in exponential localization, and…

Spectral Theory · Mathematics 2016-09-20 Valmir Bucaj

We calculate the exact value and find the polynomial of the best weighted polynomial approximation of kernels of the form $\frac {A+Bt}{(t^2+\lambda^2)^{s+1}}$, where $A$ and $B$ are fixed complex numbers, $\lambda>0$, $s\in {\mathbb N}$,…

Numerical Analysis · Mathematics 2025-11-04 Stanislav Chaichenko , Viktor Savchuk , Andrii Shidlich

We review recent results on necessary and sufficient conditions for measures on $\mathbb{R}$ and $\partial\mathbb{D}$ to yield exponential decay of the recursion coefficients of the corresponding orthogonal polynomials. We include results…

Spectral Theory · Mathematics 2007-05-23 Barry Simon

We study orthogonal structures and Fourier orthogonal series on the surface of a paraboloid $\mathbb{V}_0^{d+1} = \{(x,t): \|x\| = \sqrt{t}, \, x \in \mathbb{R}^d, \, 0\le t<1\}$. The reproducing kernels of the orthogonal polynomials with…

Classical Analysis and ODEs · Mathematics 2021-08-03 Yuan Xu

In this paper we consider an alternative orthogonal decomposition of the space $L^2$ associated to the $d$-dimensional Jacobi measure and obtain an analogous result to P.A. Meyer's Multipliers Theorem for d-dimensional Jacobi expansions.…

Analysis of PDEs · Mathematics 2007-05-23 Cristina Balderrama , Wilfredo Urbina

Orthogonal polynomials and the Fourier orthogonal series on a cone of revolution in $\mathbb{R}^{d+1}$ are studied. It is shown that orthogonal polynomials with respect to the weight function $(1-t)^\gamma (t^2-\|x\|^2)^{\mu-\frac12}$ on…

Classical Analysis and ODEs · Mathematics 2019-11-05 Yuan Xu

It is well-known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not depend on the size or shape of the filter. These fast algorithms are generally referred to as constant-time or…

Computer Vision and Pattern Recognition · Computer Science 2013-07-23 Kunal Narayan Chaudhury , Daniel Sage , Michael Unser