The purpose of this research monograph is to survey some recent developments in the analysis of shock reflection-diffraction, to present our original mathematical proofs of von Neumann’s conjectures for potential flow, to collect most of the related results and new techniques in the analysis of partial differential equations achieved in the last decades, and to discuss a set of fundamental open problems relevant to the directions of future research in this and related areas.

We consider the optimization approach to the acousto-electric imaging problem. Assuming that the electric conductivity distribution is a small perturbation of a constant, we investigate the least-squares estimate analytically using (multiple) Fourier series, and confirm the widely observed fact that acousto-electric imaging has high resolution and is statistically stable. We also analyze the case of partial data and the case of limited-view data, in which some singularities of the conductivity can still be imaged.

In this paper we study some boundary operators of a class of Bessel-type Littlewood-Paley extensions whose prototype is $$ \alignat 2 \Delta_xu(x,y)+\frac{1-2s}{y}\frac{\partial u}{\partial y}(x,y)+\frac{\partial^2u}{\partial y^2}(x,y)&=0&&\qquad\text{for}\ x\in\Bbb{R}^dd,\ y>0,\\u(x,0)&=f(x)&&\qquad\text{for}\ x\in\Bbb{R}^d. \endalignat $$ In particular, we show that with a logarithmic scaling one can capture the failure of analyticity of these extensions in the limiting cases $s=k\in\Bbb{N}$.

We establish a new on-diagonal lower estimate of continuous-time heat kernels for large time on graphs. To achieve the goal, we first introduce an upper estimate of heat kernels in natural graph metric, then use the upper estimate and the volume growth condition to show the validity of the on-diagonal lower estimate.

A computational method, based on ₁-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small