We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
For r 3, n N and each 3-monotone continuous function f on [a, b] (i.e., f is such that its third divided differences [x0, x1, x2, x3] f are nonnegative for all choices of distin...
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...
We consider rational moment problems on the real line with their associated orthogonal rational functions. There exists a Nevanlinna type parameterization relating to the problem,...
We state some pointwise estimates for the rate of weighted approximation of a continuous function on the semiaxis by polynomials. Similarly to a previous result in C[−1, 1] due ...
Abstract: Inner products of the type f, g S = f, g ψ0 + f , g ψ1 , where one of the measures ψ0 or ψ1 is the measure associated with the Jacobi polynomials, are usually referre...
Eliana X. L. de Andrade, Cleonice F. Bracciali, La...
We give a bivariate analog of the Micchelli-Rivlin quadrature for computing the integral of a function over the unit disk using its Radon projections. AMS subject classification:...
Sampling and reconstruction of generic multivariate functions is more efficient on non-Cartesian root lattices, such as the BCC (Body-Centered Cubic) lattice, than on the Cartesia...
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...