Related papers: Optimally space localized polynomials with applica…

Orthogonal polynomials for the multivariate hypergeometric distribution are defined on lattices in polyhedral domains in $\RR^d$. Their structures are studied through a detailed analysis of classical Hahn polynomials with negative integer…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…

For a family of weight functions that include the general Jacobi weight functions as special cases, exact condition for the convergence of the Fourier orthogonal series in the weighted $L^p$ space is given. The result is then used to…

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…

Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

This paper constructs adaptive sparse grid collocation method onto arbitrary order piecewise polynomial space. The sparse grid method is a popular technique for high dimensional problems, and the associated collocation method has been well…

This paper studies the probabilistic function approximation problem over reproducing kernel Hilbert spaces. We show the existence and uniqueness of the optimizer under mild assumptions. Furthermore, we generalize the celebrated representer…

In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…

Sensor network localization problem is to determine the position of the sensor nodes in a network given pairwise distance measurements. Such problem can be formulated as a polynomial minimization via the least squares method. This paper…

We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace's equation which arises in the context of the Calogero-Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials…

A learning based method for obtaining feedback laws for nonlinear optimal control problems is proposed. The learning problem is posed such that the open loop value function is its optimal solution. This infinite dimensional, function space,…

We study maximal functions related to homogeneous polynomial hypersurfaces in $\mathbb{R}^3$. In a sense made precise in this paper, the region of $(p,q)$ for which we obtain $L^p\rightarrow L^q$ boundedness is optimal up to the endpoints…

Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…

We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…

In this paper we study the density of polynomials in some $L^2(M)$ spaces. Two choices of the measure $M$ and polynomials are considered: 1) a $(N\times N)$ matrix non-negative Borel measure on $\mathbb{R}$ and vector-valued polynomials…

In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…

The problems of determining the optimal power allocation, within maximum power bounds, to (i) maximize the minimum Shannon capacity, and (ii) minimize the weighted latency are considered. In the first case, the global optima can be achieved…

We consider nonparametric regression with functional covariates, that is, they are elements of an infinite-dimensional Hilbert space. A locally polynomial estimator is constructed, where an orthonormal basis and various tuning parameters…