Decomposition theorems and approximation by a ``floating" system of exponentials

The main problem considered in this paper is the approximation of a trigonometric polynomial by a trigonometric polynomial with a prescribed number of harmonics. The method proposed here gives an opportunity to consider approximation in different spaces, among them the space of continuous functions, the space of functions with uniformly convergent Fourier series, and the space of continuous analytic functions. Applications are given to approximation of the Sobolev classes by trigonometric polynomials with prescribed number of harmonics, and to the widths of the Sobolev classes. This work supplements investigations by Maiorov, Makovoz and the author where similar results were given in the integral metric.

     

Basic Polynomial Inequalities on Intervals and Circular Arcs

We prove the right Lax-type inequality on subarcs of the unit circle of the complex plane for complex algebraic polynomials of degree n having no zeros in the open unit disk. This is done by establishing the right Bernstein–Szeg?–Videnskii type inequality for real trigonometric polynomials of degree at most n on intervals shorter than the period. The paper is closely related to recent work by B. Nagy and V. Totik. In fact, their asymptotically sharp Bernstein-type inequality for complex algebraic polynomials of degree at most n on subarcs of the unit circle is recaptured by using more elementary methods. Our discussion offers a somewhat new way to see V.S. Videnskii’s Bernstein and Markov type inequalities for trigonometric polynomials of degree at most n on intervals shorter than a period, two classical polynomial inequalities first published in 1960. A new Riesz–Schur type inequality for trigonometric polynomials is also established. Combining this with Videnskii’s Bernstein-type inequality gives Videnskii’s Markov-type inequality immediately.     

Fourier analysis on trapezoids with curved sides

It is well known that smooth periodic functions can be expanded into Fourier series and can be approximated by trigonometric polynomials. The purpose of this paper is to do Fourier analysis for smooth functions on planar domains. A planar domain can often be divided into some trapezoids with curved sides, so first we do the Fourier analysis for smooth functions on trapezoids with curved sides. We will show that any smooth function on a trapezoid with curved sides can be expanded into Fourier sine series with simple polynomial factors, and so it can be well approximated by a combination of sine polynomials and simple polynomials. Then we consider the Fourier analysis on the global domain. Finally, we extend these results to the three-dimensional case.     

On unconditional polynomial bases inL p and bergman spaces

In this paper we consider unconditional bases inL _p(T), 1<p<∞,p ≠ 2, consisting of trigonometric polynomials. We give a lower bound for the degree of polynomials in such a basis (Theorem 3.4) and show that this estimate is best possible. This is applied to the Littlewood-Paley-type decompositions. We show that such a decomposition has to contain exponential gaps. We also consider unconditional polynomial bases inH _p as bases in Bergman-type spaces and show that they provide explicit isomorphisms between Bergman-type spaces and natural sequences spaces.     

Some extremal problems for trigonometric polynomials

Three extremal problems for trigonometric polynomials are studied in this paper. The first was initiated by Maiorov. It relates to the trigonometric polynomials with n nonzero harmonics. The L_p-norm of the Weyl derivative is compared with the L_q-norm of the polynomial. The other two problems have appeared in the recent paper by Oswald. They deal with the polynomials of degree n. The minimum of L_p-norm with respect to the choice of phases is compared with l_q-norm of its coefficients.     

Comparison of two orthogonal series methods of estimating a density and its derivatives on an interval

We compare the merits of two orthogonal series methods of estimating a density and its derivatives on a compact interval—those based on Legendre polynomials, and on trigonometric functions. By examining the rates of convergence of their mean square errors we show that the Legendre polynomial estimators are superior in many respects. However, Legendre polynomial series can be more difficult to construct than trigonometric series, and to overcome this difficulty we show how to modify trigonometric series estimators to make them more competitive.     

On chromatic and flow polynomial unique graphs

It is known that the chromatic polynomial and flow polynomial of a graph are two important evaluations of its Tutte polynomial, both of which contain much information of the graph. Much research is done on graphs determined entirely by their chromatic polynomials and Tutte polynomials, respectively. Oxley asked which classes of graphs or matroids are determined by their chromatic and flow polynomials together. In this paper, we found several classes of graphs with this property. We first study which graphic parameters are determined by the flow polynomials. Then we study flow-unique graphs. Finally, we show that several classes of graphs, ladders, Möbius ladders and squares of n-cycle are determined by their chromatic polynomials and flow polynomials together. A direct consequence of our theorem is a result of de Mier and Noy [A. de Mier, M. Noy, On graphs determined by their Tutte polynomial, Graphs Comb. 20 (2004) 105-119] that these classes of graphs are Tutte polynomial unique.     

Uniform asymptotics of some q-orthogonal polynomials

Uniform asymptotic formulas are obtained for the Stieltjes-Wigert polynomial, the q⁻¹-Hermite polynomial and the q-Laguerre polynomial as the degree of the polynomial tends to infinity. In these formulas, the q-Airy polynomial, defined by truncating the q-Airy function, plays a significant role. While the standard Airy function, used frequently in the uniform asymptotic formulas for classical orthogonal polynomials, behaves like the exponential function on one side and the trigonometric functions on the other side of an extreme zero, the q-Airy polynomial behaves like the q-Airy function on one side and the q-Theta function on the other side. The last two special functions are involved in the local asymptotic formulas of the q-orthogonal polynomials. It seems therefore reasonable to expect that the q-Airy polynomial will play an important role in the asymptotic theory of the q-orthogonal polynomials.     

On center sets of ODEs determined by moments of their coefficients

The classical H. Poincaré Center-Focus problem asks about the characterization of planar polynomial vector fields such that all their integral trajectories are closed curves whose interiors contain a fixed point, a center. This problem can be reduced to a center problem for some ordinary differential equation whose coefficients are trigonometric polynomials depending polynomially on the coefficients of the field. In this paper we show that the set of centers in the Center-Focus problem can be determined as the set of zeros of some continuous functions from the moments of coefficients of this equation.     

Extremal properties of certain trigonometric functions and Chebyshev polynomials

For a wide class of symmetric trigonometric polynomials, the minimal deviation property is established. As a corollary, the extremal property is proved for the components of the Chebyshev polynomial mappings corresponding to symmetric algebras A _α.     

Spline fitting discontinuous functions given just a few Fourier coefficients

This paper considers the use of polynomial splines to approximate periodic functions with jump discontinuities of themselves and their derivatives when the information consists only of the first few Fourier coefficients and the location of the discontinuities. Spaces of splines are introduced which include, members with discontinuities at those locations. The main results deal with the orthogonal projection of such a spline space on spaces of trigonometric polynomials corresponding to the known coefficients. An approximation is defined based on inverting this projection. It is shown that when discontinuities are sufficiently far apart, the projection is invertible, its inverse has norm close to 1, and the approximation is nearly as good as directL ₂ approximation by members of the spline space. An example is given which illustrates the results and which is extended to indicate how the approximation technique may be used to provide smoothing which which accurately represents discontinuities.     

On Local Smoothness Classes of Periodic Functions

We obtain a characterization of local Besov spaces of periodic functions in terms of trigonometric polynomial operators. We construct a sequence of operators whose values are (global) trigonometric polynomials, and yet their behavior at different points reflects the behavior of the target function near each of these points. In addition to being localized, our operators preserve trigonometric polynomials of degree commensurate with the degree of polynomials given by the operators. Our constructions are “universal;” i.e., they do not require an a priori knowledge about the smoothness of the target functions. Several numerical examples are discussed, including applications to the problem of direction finding in phased array antennas and finding the location of jump discontinuities of derivatives of different order.     

Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform

We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of problems with the following characteristics: easy computation, small number of operations and easy implementation.In the second part of the paper we adapt the algorithm for computing the Hermite interpolation polynomial based on the nodes of the Tchebycheff polynomials and we also study Hermite trigonometric interpolation problems.     

Interpolation Wavelets in Boundary Value Problems

We propose and validate a simple numerical method that finds an approximate solution with any given accuracy to the Dirichlet boundary value problem in a disk for a homogeneous equation with the Laplace operator. There are many known numerical methods that solve this problem, starting with the approximate calculation of the Poisson integral, which gives an exact representation of the solution inside the disk in terms of the given boundary values of the required functions. We employ the idea of approximating a given 2π-periodic boundary function by trigonometric polynomials, since it is easy to extend them to harmonic polynomials inside the disk so that the deviation from the required harmonic function does not exceed the error of approximation of the boundary function. The approximating trigonometric polynomials are constructed by means of an interpolation projection to subspaces of a multiresolution analysis (approximation) with basis 2π-periodic scaling functions (more exactly, their binary rational compressions and shifts). Such functions were constructed by the authors earlier on the basis of Meyer-type wavelets; they are either orthogonal and at the same time interpolating on uniform grids of the corresponding scale or only interpolating. The bounds on the rate of approximation of the solution to the boundary value problem are based on the property ofMeyer wavelets to preserve trigonometric polynomials of certain (large) orders; this property was used for other purposes in the first two papers listed in the references. Since a numerical bound of the approximation error is very important for the practical application of the method, a considerable portion of the paper is devoted to this issue, more exactly, to the explicit calculation of the constants in the order bounds of the error known earlier.     

Shape preserving polynomial curves

We introduce particular systems of functions and study the properties of the associated Bézier-type curve for families of data points in the real affine space. The systems of functions are defined with the help of some linear and positive operators, which have specific properties: total positivity, nullity diminishing property and which are similar to the Bernstein polynomial operator. When the operators are polynomial, the curves are polynomial and their degrees are independent of the number of data points. Examples built with classical polynomial operators give algebraic curves written with the Jacobi polynomials, and trigonometric curves if the first and the last data points are identical.     

Deterministic sampling of sparse trigonometric polynomials

One can recover sparse multivariate trigonometric polynomials from a few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by Weil’s exponential sum. Our sampling can produce a deterministic matrix satisfying the statistical restricted isometry property, and also nearly optimal Grassmannian frames. We show that one can exactly reconstruct every M-sparse multivariate trigonometric polynomial with fixed degree and of length D from the determinant sampling X, using the orthogonal matching pursuit, and with |X| a prime number greater than (MlogD)². This result is optimal within the (logD)² factor. The simulations show that the deterministic sampling can offer reconstruction performance similar to the random sampling.     

Limits for Szegö polynomials in frequency analysis

We characterize limits for orthogonal Szegö polynomials of fixed degree k, with respect to certain measures on the unit circle which are weakly convergent to a sum of m<k point masses. Such measures arise, for example, as a convolution of point masses with an approximate identity. It is readily seen that the underlying measures in two recently-proposed methods for estimating the m frequencies, θj, of a discrete-time trigonometric signal using Szegö polynomials are of this form. We prove existence of Szegö polynomial limits associated with a general class of weakly convergent measures, and prove that for convolution of point masses with the Poisson kernel, which underlies one of the recently-proposed methods, the limit has as a factor the Szegö polynomial with respect to a related measure, which we specify. Since m of the zeros approach the eiθj, this result uniquely characterizes the limit. A similar result is obtained for measures consisting of point masses with additive absolutely continuous part.     

Greedy Algorithm and m -Term Trigonometric Approximation

We study the following nonlinear method of approximation by trigonometric polynomials in this paper. For a periodic function f we take as an approximant a trigonometric polynomial of the form , where is a set of cardinality m containing the indices of the m biggest (in absolute value) Fourier coefficients of function f . We compare the efficiency of this method with the best m -term trigonometric approximation both for individual functions and for some function classes. It turns out that the operator G _m provides the optimal (in the sense of order) error of m -term trigonometric approximation in the L _p -norm for many classes. September 23, 1996. Date revised: February 3, 1997.     

Fourier and barycentric formulae for equidistant Hermite trigonometric interpolation

We consider the Hermite trigonometric interpolation problem of order 1 for equidistant nodes, i.e., the problem of finding a trigonometric polynomial t that interpolates the values of a function and of its derivative at equidistant points. We give a formula for the Fourier coefficients of t in terms of those of the two classical trigonometric polynomials interpolating the values and those of the derivative separately. This formula yields the coefficients with a single FFT. It also gives an aliasing formula for the error in the coefficients which, on its turn, yields error bounds and convergence results for differentiable as well as analytic functions. We then consider the Lagrangian formula and eliminate the unstable factor by switching to the barycentric formula. We also give simplified formulae for even and odd functions, as well as consequent formulae for Hermite interpolation between Chebyshev points.     

Efficient polynomial reduction

H-bases are bases for polynomial ideals, characterized by the fact that their homogeneous leading terms are a basis for the associated homogeneous ideal. In the computation ofH-bases without term orders, an important task is to determine the orthogonal projection of a homogeneous polynomial to certain subspaces of homogeneous polynomials with respect to a given inner product. One way of doing so is to use an orthogonal basis of the subspace. In this paper, we present and study a method to efficiently compute such a basis for a particular but important inner product.