Results 1  10
of
314
Data compression and harmonic analysis
 IEEE Trans. Inform. Theory
, 1998
"... In this paper we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory... ..."
Abstract

Cited by 177 (23 self)
 Add to MetaCart
In this paper we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory...
Multilinear Calderón Zygmund theory
 ADV. IN MATH. 40
, 1996
"... A systematic treatment of multilinear CalderónZygmundoperators is presented. The theory developed includes strong type and endpoint weak type estimates, interpolation, the multilinear T1 theorem, anda variety of results regarding multilinear multiplier operators. ..."
Abstract

Cited by 92 (18 self)
 Add to MetaCart
A systematic treatment of multilinear CalderónZygmundoperators is presented. The theory developed includes strong type and endpoint weak type estimates, interpolation, the multilinear T1 theorem, anda variety of results regarding multilinear multiplier operators.
Multilinear operators given by singular multipliers
 J. Amer. Math. Soc
"... Abstract. We prove L p estimates for a large class of multilinear operators, which includes the multilinear paraproducts studied by Coifman and Meyer [7], as well as the bilinear Hilbert transform. 1. ..."
Abstract

Cited by 89 (23 self)
 Add to MetaCart
Abstract. We prove L p estimates for a large class of multilinear operators, which includes the multilinear paraproducts studied by Coifman and Meyer [7], as well as the bilinear Hilbert transform. 1.
HARDY SPACES ASSOCIATED TO NONNEGATIVE SELFADJOINT OPERATORS SATISFYING DAVIESGAFFNEY ESTIMATES
"... Abstract. Let X be a metric space with doubling measure, and L be a nonnegative, selfadjoint operator satisfying DaviesGaffney bounds on L 2 (X). In this article we develop a theory of Hardy and BMO spaces associated to L, including an atomic (or molecular) decomposition, square function characte ..."
Abstract

Cited by 47 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Let X be a metric space with doubling measure, and L be a nonnegative, selfadjoint operator satisfying DaviesGaffney bounds on L 2 (X). In this article we develop a theory of Hardy and BMO spaces associated to L, including an atomic (or molecular) decomposition, square function characterization, duality of Hardy and BMO spaces. Further specializing to the case that L is a Schrödinger operator on R n with a nonnegative, locally integrable potential, we establish addition characterizations of such Hardy space in terms of maximal functions. Finally, (X) for p> 1, which may or may not coincide with the space L p (X), and show that they interpolate with H 1 L(X) spaces by the complex method. we define Hardy spaces H p L The authors gratefully acknowledge support from NSF as follows: S. Hofmann (DMS
Fontelos, Formation of singularities for a transport equation with nonlocal velocity
 Ann. of Math
"... We study a 1D transport equation with nonlocal velocity and show the formation of singularities in finite time for a generic family of initial data. By adding a diffusion term the finite time singularity is prevented and the solutions exist globally in time. 1. ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
(Show Context)
We study a 1D transport equation with nonlocal velocity and show the formation of singularities in finite time for a generic family of initial data. By adding a diffusion term the finite time singularity is prevented and the solutions exist globally in time. 1.
Uniform bounds for the bilinear Hilbert transforms
 889–993. MR2113017 (2006e:42011), Zbl 1071.44004. Xiaochun Li
, 2004
"... Abstract. We continue the investigation initiated in [8] of uniform Lp bounds � for the family of bilinear Hilbert transforms Hα,β(f, g)(x) = p.v. f(x − αt)g(x − βt) R dt t. In this work we show that Hα,β map Lp1 (R) × Lp2 (R) into Lp (R) uniformly in the real parameters α, β satisfying  α β − 1  ..."
Abstract

Cited by 35 (14 self)
 Add to MetaCart
Abstract. We continue the investigation initiated in [8] of uniform Lp bounds � for the family of bilinear Hilbert transforms Hα,β(f, g)(x) = p.v. f(x − αt)g(x − βt) R dt t. In this work we show that Hα,β map Lp1 (R) × Lp2 (R) into Lp (R) uniformly in the real parameters α, β satisfying  α β − 1  ≥ c> 0 when 1 < p1, p2 < 2 and 2 p1p2 3 < p = < ∞. p1+p2 As a corollary we obtain Lp × L ∞ → Lp uniform bounds in the range 4/3 < p < 4 for the H1,α’s when α ∈ [0, 1). 1.
Can recent innovations in harmonic analysis `explain' key findings in natural image statistics
 Network: Computation in Neural Systems
"... Recently, applied mathematicians have been pursuing the goal of sparse coding of certain mathematical models of images with edges. They have found by mathematical analysis that, instead of wavelets and Fourier methods, sparse coding leads towards new systems: ridgelets and curvelets. These new syste ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
Recently, applied mathematicians have been pursuing the goal of sparse coding of certain mathematical models of images with edges. They have found by mathematical analysis that, instead of wavelets and Fourier methods, sparse coding leads towards new systems: ridgelets and curvelets. These new systems have elements distributed across a range of scales and locations, but also orientations. In fact they have highly directionspecific elements and exhibit increasing numbers of distinct directions as we go to successively finer scales. Meanwhile, researchers in Natural Scene Statistics (NSS) have been attempting to find sparse codes for natural images. The new systems they have found by computational optimization have elements distributed across a range of scales and locations, but also orientations. The new systems are certainly unlike wavelet and gabor systems, on the one hand because of the multiorientation and on the other hand because of the multiscale nature. There is a certain degree of visual resemblance between the findings in the two fields, which suggests the hypothesis that certain important findings in the NSS literature
The Marcinkiewicz multiplier condition for bilinear operators
 Studia Math. 146 (2001), 115–156. LOUKAS GRAFAKOS
"... Abstract. This article is concerned with the question of whether Marcinkiewicz multipliers on R2n give rise to bilinear multipliers on Rn × Rn.We show that this is not always the case. Moreover we find necessary and sufficient conditions for such bilinear multipliers to be bounded. These conditions ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
(Show Context)
Abstract. This article is concerned with the question of whether Marcinkiewicz multipliers on R2n give rise to bilinear multipliers on Rn × Rn.We show that this is not always the case. Moreover we find necessary and sufficient conditions for such bilinear multipliers to be bounded. These conditions in particular imply that a slight logarithmic modification of the Marcinkiewicz condition gives multipliers for which the corresponding bilinear operators are bounded on products of Lebesgue and Hardy spaces. 1.
Euclidean algorithms are Gaussian
, 2003
"... Abstract. We prove a Central Limit Theorem for a general class of costparameters associated to the three standard Euclidean algorithms, with optimal speed of convergence, and error terms for the mean and variance. For the most basic parameter of the algorithms, the number of steps, we go further an ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
(Show Context)
Abstract. We prove a Central Limit Theorem for a general class of costparameters associated to the three standard Euclidean algorithms, with optimal speed of convergence, and error terms for the mean and variance. For the most basic parameter of the algorithms, the number of steps, we go further and prove a Local Limit Theorem (LLT), with speed of convergence O((log N) −1/4+ǫ). This extends and improves the LLT obtained by Hensley [27] in the case of the standard Euclidean algorithm. We use a “dynamical analysis ” methodology, viewing an algorithm as a dynamical system (restricted to rational inputs), and combining tools imported from dynamics, such as the crucial transfer operators, with various other techniques: Dirichlet series, Perron’s formula, quasipowers theorems, the saddle point method. Dynamical analysis had previously been used to perform averagecase analysis of algorithms. For the present (dynamical) analysis in distribution, we require precise estimates on the transfer operators, when a parameter varies along vertical lines in the complex plane. Such estimates build on results obtained only recently by Dolgopyat in the context of continuoustime dynamics [20]. 1.