Related papers: A functional view of upper bounds on codes
The problem of a differential operator left- and right division is solved in terms of generalized Bell polinomials for nonabelian differential unitary ring. The definition of the polinomials is made by means of recurrent relations. The…
It is shown that the CMV Laurent polynomials associated to the sieved Jacobi polynomials on the unit circle satisfy an eigenvalue equation with respect to a first order differential operator of Dunkl type. Using this result, the sieved…
Highly localized kernels constructed by orthogonal polynomials have been fundamental in recent development of approximation and computational analysis on the unit sphere, unit ball and several other regular domains. In this work we first…
In this note we set up the elliptic and the parabolic Dirichlet problem for linear nonlocal operators. As opposed to the classical case of second order differential operators, here the "boundary data" are prescribed on the complement of a…
In arXiv:1306.2914 a method for approximate solution of Sturm-Liouville equations and related spectral problems was presented based on the construction of the Delsarte transmutation operators. The problem of numerical approximation of…
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…
We study the existence of large solutions for nonlocal Dirichlet problems posed on a bounded, smooth domain, associated to fully nonlinear elliptic equations of order $2s$, with $s\in (1/2,1)$, and a coercive gradient term with subcritical…
A representation of the Jacobi algebra $\mathfrak{h}_1\rtimes \mathfrak{su}(1,1)$ by first order differential operators with polynomial coefficients on the manifold $\mathbb{C}\times \mathcal{D}_1$ is presented. The Hilbert space of…
In this paper we develop a numerical scheme based on quadratures to approximate solutions of integro-differential equations involving convolution kernels, $\nu$, of diffusive type. In particular, we assume $\nu$ is symmetric and…
We provide a new method to approximate a (possibly discontinuous) function using Christoffel-Darboux kernels. Our knowledge about the unknown multivariate function is in terms of finitely many moments of the Young measure supported on the…
In this article, a new reproducing kernel approach is developed for obtaining numerical solution of nonlinear three-point boundary value problems with fractional order. This approach is based on reproducing kernel which is constructed by…
It is developed the theory of the boundary behavior of homeomorphic solutions of the Beltrami equations ${\bar{\partial}}f=\mu\,{\partial}f$ of the Sobolev class $W^{1,1}_{\rm loc}$ with respect to prime ends of domains. On this basis,…
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time…
We consider the problem of inference in higher-order undirected graphical models with binary labels. We formulate this problem as a binary polynomial optimization problem and propose several linear programming relaxations for it. We compare…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
This paper derives error bounds for regression in continuous time over subsets of certain types of Riemannian manifolds.The regression problem is typically driven by a nonlinear evolution law taking values on the manifold, and it is cast as…
The kernel polynomial method based on Jacobi polynomials $P_n^{\alpha,\beta}(x)$ is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of…
We study the Dirichlet problem in Lipschitz domains and with boundary data in Besov spaces, for divergence form strongly elliptic systems of arbitrary order, with bounded, complex-valued coefficients. Our main result gives a sharp condition…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results…