No abstract uploaded!

We show that theMöbius function is disjoint to every analytic skew product dynamical system on T2 over a rotation of the circle.

We describe local mirror symmetry from a mathematical point of view and make several A-model calculations using the mirror principle (localization). Our results agree with B-model computations from solutions of Picard-Fuchs differential equations constructed form the local geometry near a Fano surface within a Calabi-Yau manifold. We interpret the Gromov-Witten-type numbers from an enumerative point of view. We also describe the geometry of singular surfaces and show how the local invariants of singular surfaces agree with the smooth cases when they occur as complete intersections.

We consider the problem of reconstructing unknown inclusions inside a thermal conductor from boundary measurements, which arises from active thermography and is formulated as an inverse boundary value problem for the heat equation. In our previous works, we proposed a sampling-type method for reconstructing the boundary of the unknown inclusion and gave its rigorous mathematical justification. In this paper, we continue our previous works and provide a further investigation of the reconstruction method from both the theoretical and numerical points of view. First, we analyze the solvability of the Neumann-to-Dirichlet map gap equation and establish a relation of its solution to the Green function of an interior transmission problem for the inclusion. This naturally provides a way of computing this Green function from the Neumann-to-Dirichlet map. Our new findings reveal the essence of the reconstruction method. A convergence result for noisy measurement data is also proved. Second, based on the heat layer potential argument, we perform a numerical implementation of the reconstruction method for the homogeneous inclusion case. Numerical results are presented to show the efficiency and stability of the proposed method.

In this article, we propose a numerical method based on sparse Gaussian processes (SGPs) to solve nonlinear partial differential equations (PDEs). The SGP algorithm is based on a Gaussian process (GP) method, which approximates the solution of a PDE with the maximum a posteriori probability estimator of a GP conditioned on the PDE evaluated at a finite number of sample points. The main bottleneck of the GP method lies in the inversion of a covariance matrix, whose cost grows cubically with respect to the size of samples. To improve the scalability of the GP method while retaining desirable accuracy, we draw inspiration from SGP approximations, where inducing points are introduced to summarize the information of samples. More precisely, our SGP method uses a Gaussian prior associated with a low-rank kernel generated by inducing points randomly selected from samples. In the SGP method, the size of the matrix to be inverted is proportional to the number of inducing points, which is much less than the size of the samples. The numerical experiments show that the SGP method using less than half of the uniform samples as inducing points achieves comparable accuracy to the GP method using the same number of uniform samples, which significantly reduces the computational cost. We give the existence proof for the approximation to the solution of a PDE and provide rigorous error analysis.