Abstract In this paper, we study the high-dimensional super-resolution imaging problem. Here, are given an image of a number point sources light whose locations and intensities unknown. The is pixelized blurred by known point-spread function arising from device. We encode unknown their via non-negative measure propose convex optimization program to find it. Assuming device’s componentwise decom...

We characterize distributions with respect to which the members of a Tchebychev set of polynomials are orthogonal when they satisfy differential equations with polynomial coefficients. As an application, we find a real weight of bounded variation with support in [0, oo) for Bessel polynomials.

We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.

We present a new approach for the Spectral Direct Numerical Simulation (DNS) of LowRm wall bounded magnetohydrodynamic (MHD) flows. The novelty is that instead of using bases like the usual Tchebychev polynomials, that are easy to implement but incur heavy computational costs in order to resolve the Hartmann boundary layers that arise along the walls, we use a basis made of elements that alread...