Optimal error estimates for an approximation of degenerate parabolic problems

A fully discrete scheme for a class of multidimensional degenerate parabolic equations is proposed. The discretization is given by $supoesup piecewise linear finite elements in space and backward differences in time (the smoothing procedure is avoided). Numerical integration is used; hence the proposed method is easy to implement. Optimal error estimates in energy norms are proved for the solutions.     

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.     

Some equivalent definitions of Besov spaces of generalized smoothness

In this paper, we present some alternative definitions of Besov spaces of generalized smoothness, defined via Littlewood–Paley‐type decomposition, involving weak derivatives, polynomials, convolutions and generalized interpolation spaces.     

Quasi-exchange Formulas for Wavelet Transforms of Distributions

We investigate the wavelet transforms of tempered distributions in a way that closely links their Fourier transforms and wavelet transforms. Two exchange formulas of the convolution and the multiplication of wavelet transforms of tempered distributions are established. We call these formulas the quasi-exchange formulas for wavelet transforms of distributions, because of the resemblance between these formulas and the well-known exchange formula for Fourier transforms.     

A new factorization technique of the matrix mask of univariate refinable functions

Summary. A univariate compactly supported refinable function can always be written as the convolution product , with the B-spline of order k,f a compactly supported distribution, and k the approximation orders provided by the underlying shift-invariant space . Factorizations of univariate refinable vectors were also studied and utilized in the literature. One of the by-products of this article is a rigorous analysis of that factorization notion, including, possibly, the first precise definition of that process. The main goal of this article is the introduction of a special factorization algorithm of refinable vectors that generalizes the scalar case as closely (and unexpectedly) as possible: the original vector is shown to be `almost' in the form , with F still compactly supported and refinable, andk the approximation order of . The algorithm guarantees F to retain the possible favorable properties of , such as the stability of the shifts of and/or the polynomiality of the mask symbol. At the same time, the theory and the algorithm are derived under relatively mild conditions and, in particular, apply to whose shifts are not stable, as well as to refinable vectors which are not compactly supported. The usefulness of this specific factorization for the study of the smoothness of FSI wavelets (known also as `multiwavelets' and `multiple wavelets') is explained. The analysis invokes in an essential way the theory of finitely generated shift-invariant (FSI) spaces, and, in particular, the tool of superfunction theory. Received June 10, 1998 / Revised version received June 14, 1999 / Published online August 2, 2000     

Atomic and molecular decompositions of anisotropic Besov spaces

In this work we develop the theory of weighted anisotropic Besov spaces associated with general expansive matrix dilations and doubling measures with the use of discrete wavelet transforms. This study extends the isotropic Littlewood- Paley methods of dyadic -transforms of Frazier and Jawerth [19, 21] to non-isotropic settings.Several results of isotropic theory of Besov spaces are recovered for weighted anisotropic Besov spaces. We show that these spaces are characterized by the magnitude of the -transforms in appropriate sequence spaces. We also prove boundedness of an anisotropic analogue of the class of almost diagonal operators and we obtain atomic and molecular decompositions of weighted anisotropic Besov spaces, thus extending isotropic results of Frazier and Jawerth [21].The author was partially supported by the NSF grant DMS-0441817.     

On quasi-strongly regular graphs

We study the quasi-strongly regular graphs, which are a combinatorial generalization of the strongly regular and the distance regular graphs. Our main focus is on quasi-strongly regular graphs of grade 2. We prove a “spectral gap”-type result for them which generalizes Seidel's well-known formula for the eigenvalues of a strongly regular graph. We also obtain a number of necessary conditions for the feasibility of parameter sets and some structural results. We propose the heuristic principle that the quasi-strongly regular graphs can be viewed as a “lower-order approximation” to the distance regular graphs. This idea is illustrated by extending a known result from the distance-regular case to the quasi-strongly regular case. Along these lines, we propose a number of conjectures and open problems. Finally, we list the all the proper connected quasi-strongly graphs of grade 2 with up to 12 vertices.     

Tractable embeddings of Besov spaces into small Lebesgue spaces

This paper deals with dimension‐controllable (tractable) embeddings of Besov spaces on n‐dimensional torus into small Lebesgue spaces. Our techniques rely on the approximation structure of Besov spaces, extrapolation properties of small Lebesgue spaces and interpolation.     

Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant (FSI) subspace of L ₂(R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a (necessarily unique) satisfying for |j|<k , . The technical condition is satisfied, e.g., when the generators are at infinity for some >k+d. In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19, 1996. Dates revised: September 6, 1996, March 4, 1997.     

Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant subspace S(Φ) of L ₂ (R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a ψ (necessarily unique) satisfying . The technical condition is satisfied, e.g., when the generators are at infinity for some ρ>k+d . In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19. 1996. Date revised: September 6, 1996.     

Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information

We discuss the reconstruction of piecewise smooth data from its (pseudo-) spectral information. Spectral projections enjoy superior resolution provided the data is globally smooth, while the presence of jump discontinuities is responsible for spurious O (1) Gibbs oscillations in the neighborhood of edges and an overall deterioration of the unacceptable first-order convergence in rate. The purpose is to regain the superior accuracy in the piecewise smooth case, and this is achieved by mollification. Here we utilize a modified version of the two-parameter family of spectral mollifiers introduced by Gottlieb and Tadmor [GoTa85]. The ubiquitous one-parameter, finite-order mollifiers are based on dilation . In contrast, our mollifiers achieve their high resolution by an intricate process of high-order cancellation . To this end, we first implement a localization step using an edge detection procedure [GeTa00a, b]. The accurate recovery of piecewise smooth data is then carried out in the direction of smoothness away from the edges, and adaptivity is responsible for the high resolution. The resulting adaptive mollifier greatly accelerates the convergence rate, recovering piecewise analytic data within exponential accuracy while removing the spurious oscillations that remained in [GoTa85]. Thus, these adaptive mollifiers offer a robust, general-purpose ``black box' procedure for accurate post-processing of piecewise smooth data. March 29, 2001. Final version received: August 31, 2001.     

Variational Principles and Sobolev-Type Estimates for Generalized Interpolation on a Riemannian Manifold

The purpose of this paper is to study certain variational principles and Sobolev-type estimates for the approximation order resulting from using strictly positive definite kernels to do generalized Hermite interpolation on a closed (i.e., no boundary), compact, connected, orientable, m -dimensional C ^∞ Riemannian manifold , with C ^∞ metric g _ij . The rate of approximation can be more fully analyzed with rates of approximation given in terms of Sobolev norms. Estimates on the rate of convergence for generalized Hermite and other distributional interpolants can be obtained in certain circumstances and, finally, the constants appearing in the approximation order inequalities are explicit. Our focus in this paper will be on approximation rates in the cases of the circle, other tori, and the 2 -sphere. April 10, 1996. Dates revised: March 26, 1997; August 26, 1997. Date accepted: September 12, 1997. Communicated by Ronald A. DeVore.     

Adaptive frame methods for nonlinear variational problems

In this paper we develop adaptive numerical solvers for certain nonlinear variational problems. The discretization of the variational problems is done by a suitable frame decomposition of the solution, i.e., a complete, stable, and redundant expansion. The discretization yields an equivalent nonlinear problem on the space of frame coefficients. The discrete problem is then adaptively solved using approximated nested fixed point and Richardson type iterations. We investigate the convergence, stability, and optimal complexity of the scheme. A theoretical advantage, for example, with respect to adaptive finite element schemes is that convergence and complexity results for the latter are usually hard to prove. The use of frames is further motivated by their redundancy, which, at least numerically, has been shown to improve the conditioning of the discretization matrices. Also frames are usually easier to construct than Riesz bases. We present a construction of divergence-free wavelet frames suitable for applications in fluid dynamics and magnetohydrodynamics. M. Fornasier acknowledges the financial support provided through the Intra-European Individual Marie Curie Fellowship Programme, under contract MOIF-CT-2006-039438. All of the authors acknowledge the hospitality of Dipartimento di Metodi e Modelli Matematici per le Scienze Applicate, Università di Roma “La Sapienza”, Italy, during the early preparation of this work. The authors want to thank Daniele Boffi, Dorina Mitrea, and Karsten Urban for the helpful and fruitful discussions on divergence-free function spaces.     

Approximation of the Hausdorff distance by the distance of continuous surjections

The aim of this paper is to answer the following question: let (X,?) and (Y,d) be metric spaces, let A,B⊂Y be continuous images of the space X and let be a fixed continuous surjection. When is the inequality

     

The Segal Algebra {\bf S}_0({\Bbb R}^d) and Norm Summability of Fourier Series and Fourier Transforms

A general summability method, the so-called θ-summability is considered for multi-dimensional Fourier series. Equivalent conditions are derived for the uniform and L ₁-norm convergence of the θ-means σ _n ^θ f to the function f. If f is in a homogeneous Banach space, then the preceeding convergence holds in the norm of the space. In case θ is an element of Feichtinger’s Segal algebra , then these convergence results hold. Some new sufficient conditions are given for θ to be in . A long list of concrete special cases of the θ-summation is listed. The same results are also provided in the context of Fourier transforms, indicating how proofs have to be changed in this case. This research was supported by Lise Meitner fellowship No M733-N04 and the Hungarian Scientific Research Funds (OTKA) No T043769, T047128, T047132.     

A Class of Periodic Function Spaces and Interpolation on Sparse Grids

We present a unified approach to error estimates of periodic interpolation on equidistant, full, and sparse grids for functions from a scale of function spaces which includes L ₂-Sobolev spaces, the Wiener algebra and the Korobov spaces.     

A new Brézis‐Gallouët‐Wainger inequality from the viewpoint of the real interpolation functors

The Brézis‐Gallouët‐Wainger inequality describes a subtle embedding property into . The relation between the Brézis‐Gallouët‐Wainger inequality and the real interpolation functor together with the sharpness of the results is discussed in the present paper. As our first main results shows, it turns out that there are two intermediate terms between and the logarithmic boundedness, which is supposed to be the right‐hand side of the Brézis‐Gallouët‐Wainger inequality. As the second result, the first result is extended to inequalities which reflect the meaning of the second index of Besov spaces and the interpolation theorem.     

On function spaces related to fractional diffusions on d-sets

We prove that all the Dirichlet forms associated with certain diffusions on a d-set are equivalent and that their common domain is an integral Lipschitz space. We also provide an analytic characterisation of the walk dimension d_w of a d-set F and show that all fractional diffusions on F share d_w as their walk dimension.