Tunneling Estimates and Approximate Controllability for Hypoelliptic Equations (Paperback)

This memoir is concerned with quantitative unique continuation estimates for equations involving a "sum of squares" operator L on a compact manifold M assuming: (i) the Chow-Rashevski-Hormander condition ensuring the hypoellipticity of L,and(ii) the analyticity of M and the coefficients of L. The first result is the tunneling estimate ?L2(?) ? Ce?c?k 2 for normalized eigenfunctions ? of L from a nonempty open set ? ?M,wherek is the hypoellipticity index of L and ? the eigenvalue. The main result is a stability estimate for solutions to the hypoelliptic wave equation (?2 t + L)u =0:forT>2supx?M(dist(x,?)) (here, dist is the subRiemannian distance), the observation of the solution on (0,T) x ? determines the data. The constant involved in the estimate is Cec?k where?isthetypical frequency of the data. Wethen prove the approximate controllability of the hypoelliptic heat equation (?t +L)v = 1?f in any time, with appropriate (exponential) cost, depending on k. In case k = 2 (Grushin, Heisenberg...), we further show approximate controllability to trajectories with polynomial cost in large time. We also explain how the a nalyticity assumption can be relaxed, and a boundary ?Mcan be added in some situations.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	Memoirs of the American Mathematical Society
Release date:	June 2022
Authors:	Camille Laurent • Matthieu Leautaud
Dimensions:	254 x 178mm (L x W)
Format:	Paperback
Pages:	95
ISBN-13:	978-1-4704-5138-7
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Differential equations Promotions
LSN:	1-4704-5138-7
Barcode:	9781470451387

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!