Extremal Values of L-Functions Associated with Newforms in the Half-Plane of Absolute Convergence

We prove estimates for extremal values of L-functions associated with newforms f in the half-plane of absolute convergence of their Dirichlet series expansion. The proof is based on an effective version of Kronecker's approximation theorem and estimates for the Fourier coefficients of the newform f.     

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.     

Existence of global strong solution to the micropolar fluid system in a bounded domain

In this paper we are concerned with the initial boundary value problem of the micropolar fluid system in a three dimensional bounded domain. We study the resolvent problem of the linearized equations and prove the generation of analytic semigroup and its time decay estimates. In particular, L^p–L^q type estimates are obtained. By use of the L^p–L^q estimates for the semigroup, we prove the existence theorem of global in time solution to the original nonlinear problem for small initial data. Furthermore, we study the magneto‐micropolar fluid system in the final section. Copyright © 2005 John Wiley & Sons, Ltd.     

Greedy Algorithms with Regard to Multivariate Systems with Special Structure

The question of finding an optimal dictionary for nonlinear m -term approximation is studied in this paper. We consider this problem in the periodic multivariate (d variables) case for classes of functions with mixed smoothness. We prove that the well-known dictionary U ^d which consists of trigonometric polynomials (shifts of the Dirichlet kernels) is nearly optimal among orthonormal dictionaries. Next, it is established that for these classes near-best m -term approximation, with regard to U ^d , can be achieved by simple greedy-type (thresholding-type) algorithms. The univariate dictionary U is used to construct a dictionary which is optimal among dictionaries with the tensor product structure. June 22, 1998. Date revised: March 26, 1999. Date accepted: March 22, 1999.     

Vector greedy algorithms

Our objective is to study nonlinear approximation with regard to redundant systems. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. Greedy-type approximations proved to be convenient and efficient ways of constructing m-term approximants. We introduce and study vector greedy algorithms that are designed with aim of constructing mth greedy approximants simultaneously for a given finite number of elements. We prove convergence theorems and obtain some estimates for the rate of convergence of vector greedy algorithms when elements come from certain classes.     

Best m-term one-sided trigonometric approximation of some function classes defined by a kind of multipliers

In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the norm Lp （1 ≤ p ≤ ∞） of multiplier function classes and the corresponding m-term Greedy-liked one-sided trigonometric approximation results.     

Near Best Tree Approximation

Tree approximation is a form of nonlinear wavelet approximation that appears naturally in applications such as image compression and entropy encoding. The distinction between tree approximation and the more familiar n-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure. This makes their positions easy to encode. Previous work [4,6] has established upper bounds for the error of tree approximation for certain (Besov) classes of functions. This paper, in contrast, studies tree approximation of individual functions with the aim of characterizing those functions with a prescribed approximation error. We accomplish this in the case that the approximation error is measured in L ₂, or in the case p2, in the Besov spaces B _p ⁰(L _p ), which are close to (but not the same as) L _p . Our characterization of functions with a prescribed approximation order in these cases is given in terms of a certain maximal function applied to the wavelet coefficients.     

The mean field kinetic equation for interacting particle systems with non-Lipschitz force

In this paper, we prove the global existence of the weak solution to the mean field kinetic equation derived from the N-particle Newtonian system. For L¹∩L^∞ initial data, the solvability of the mean field kinetic equation can be obtained by using uniform estimates and compactness arguments while the difficulties arising from the nonlocal nonlinear interaction are tackled appropriately using the Aubin-Lions compact embedding theorem.     

Entropy,Universal Coding,Approximation, and Bases Properties

We shall present here results concerning the metric entropy of spaces of linear and nonlinear approximation under very general conditions. Our first result computes the metric entropy of the linear and m-terms approximation classes according to a quasi-greedy basis verifying the Temlyakov property. This theorem shows that the second index r is not visible throughout the behavior of the metric entropy. However, metric entropy does discriminate between linear and nonlinear approximation. Our second result extends and refines a result obtained in a Hilbertian framework by Donoho, proving that under orthosymmetry conditions, m-terms approximation classes are characterized by the metric entropy. Since these theorems are given under the general context of quasi-greedy bases verifying the Temlyakov property, they have a large spectrum of applications. For instance, it is proved in the last section that they can be applied in the case of L _p norms for R ^d for 1 < p < \infty. We show that the lower bounds needed for this paper in fact follow from quite simple large deviation inequalities concerning hypergeometric or binomial distributions. To prove the upper bounds, we provide a very simple universal coding based on a thresholding-quantizing constructive procedure.     

Neumann and mixed problems on curvilinear polyhedra

We prove regularity results inL ^p Sobolev spaces. On one hand, we state some abstract results byL ^p functional techniques: exponentially decreasing estimates in dyadic partitions of cones and dihedra, operator valued symbols and Marcinkievicz's theorem. On the other hand, we derive more concrete statements with the help of estimates about the first non-zero eigenvalue of some Laplace-Beltrami operators on spherical domains.     

Two-Level-Split Decomposition of Anisotropic Besov Spaces

Anisotropic Besov spaces (B-spaces) are developed based on anisotropic multilevel ellipsoid covers (dilations) of ℝ ⁿ . This extends earlier results on anisotropic Besov spaces. Furthermore, sequences of anisotropic bases are constructed and utilized for two-level-split decompositions of the B-spaces and nonlinear m-term approximation.     

On the jackson theorem for periodic functions in spaces with integral metric

We consider the approximation of periodic functions by trigonometric polynomials in metric (not normed) spaces that are generalizations of the spaces L _p , 0 < p < 1, and L ₀. In particular, we prove the multidimensional Jackson theorem in L _p (T ^m ), 0 < p < 1.     

On Lebesgue-type inequalities for greedy approximation

We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and the Orthogonal Greedy Algorithm in terms of the best m-term approximations. We call such estimates the Lebesgue-type inequalities. We prove the Lebesgue-type inequalities for dictionaries with special structure. We assume that the dictionary has a property of mutual incoherence (the coherence parameter of the dictionary is small). We develop a new technique that, in particular, allowed us to get rid of an extra factor m^1/2 in the Lebesgue-type inequality for the Orthogonal Greedy Algorithm.     

Weak solutions to a nonlinear variational wave equation and some related problems

In this paper we present some results on the global existence of weak solutions to a nonlinear variational wave equation and some related problems. We first introduce the main tools, the L ^p Young measure theory and related compactness results, in the first section. Then we use the L ^p Young measure theory to prove the global existence of dissipative weak solutions to the asymptotic equation of the nonlinear wave equation, and comment on its relation to Camassa-Holm equations in the second section. In the third section, we prove the global existence of weak solutions to the original nonlinear wave equation under some restrictions on the wave speed. In the last section, we present global existence of renormalized solutions to two-dimensional model equations of the asymptotic equation, which is also the so-called vortex density equation arising from sup-conductivity.     

Unique continuation for elliptic operators with non-multiple characteristics

In this paper we prove a unique continuation theorem for elliptic operators of the formP(D)+V(x), whereP(D) has orderm≥2 and simple complex characteristics, andV(x)∈L ^n/m (R ⁿ ). To prove our main theorem we use a restriction theorem for the Fourier transform to manifolds of codimension 2.     

Existence of Positive Solutions for Multi-Point Boundary Value Problem with Strong Singularity

In this study, using a fixed point index theorem on a cone, we present some existence results for one or multiple positive solutions to the m-point boundary value problem with a nonlinear term which does not satisfy the L ¹-Carathéodory condition.     

On the weak L p -Hodge decomposition and Beurling�CAhlfors transforms on complete Riemannian manifolds

Based on a new martingale representation formula, we prove some quantitative upper bound estimates of the L ^p -norm of some singular integral operators on complete Riemannian manifolds. This leads us to establish the Weak L ^p -Hodge decomposition theorem and to prove the L ^p -boundedness of the Beurling?CAhlfors transforms on complete non-compact Riemannian manifolds with non-negative Weitzenb?ck curvature operator.     

Nonlinear Methods of Approximation

Abstract. Our main interest in this paper is nonlinear approximation. The basic idea behind nonlinear approximation is that the elements used in the approximation do not come from a fixed linear space but are allowed to depend on the function being approximated. While the scope of this paper is mostly theoretical, we should note that this form of approximation appears in many numerical applications such as adaptive PDE solvers, compression of images and signals, statistical classification, and so on. The standard problem in this regard is the problem of m -term approximation where one fixes a basis and looks to approximate a target function by a linear combination of m terms of the basis. When the basis is a wavelet basis or a basis of other waveforms, then this type of approximation is the starting point for compression algorithms. We are interested in the quantitative aspects of this type of approximation. Namely, we want to understand the properties (usually smoothness) of the function which govern its rate of approximation in some given norm (or metric). We are also interested in stable algorithms for finding good or near best approximations using m terms. Some of our earlier work has introduced and analyzed such algorithms. More recently, there has emerged another more complicated form of nonlinear approximation which we call highly nonlinear approximation. It takes many forms but has the basic ingredient that a basis is replaced by a larger system of functions that is usually redundant. Some types of approximation that fall into this general category are mathematical frames, adaptive pursuit (or greedy algorithms), and adaptive basis selection. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. With this motivation, our recent work and the current activity focuses on nonlinear approximation both in the classical form of m -term approximation (where several important problems remain unsolved) and in the form of highly nonlinear approximation where a theory is only now emerging.     

Exact L 2 Small Balls of Gaussian Processes

We prove a comparison theorem extending Li(6) and develop a complex-analytic approach to treat L ² small ball probabilities of Gaussian processes. We demonstrate the techniques for the m-times integrated Brownian motions and in examples where one can not apply Li comparison theorem.     

Approximation characteristics for diagonal operators in different computational settings

First we study several extremal problems on minimax, and prove that they are equivalent. Then we connect this result with the exact values of some approximation characteristics of diagonal operators in different settings, such as the best n-term approximation, the linear average and stochastic n-widths, and the Kolmogorov and linear n-widths. Most of these exact values were known before, but in terms of equivalence of these extremal problems, we present a unified approach to give them a direct proof.