The goal of smooth function reconstruction on a 2D or 3D manifold is to obtain a smooth function on surfaces or higher dimensional manifolds. It is a common problem in computer graphics and computational mathematics, especially in civil engineering including structural analysis of solid objects. In this chapter, we introduce a new method using harmonic functions for solving this problem. This method contains the following steps: (1) Partition the boundary surfaces of the 3D manifold based on sample points so that each sample point is on the edge of the partition. (2) Use gradually varied interpolation on the edges so that each point on the edge will be assigned a value. In addition, all values on the edge are gradually varied. (3) Use discrete harmonic functions to fit the unknown points, i.e. the points inside each partition patch. This solution of the fitting becomes the piecewise harmonic function.

We establish uniform error bounds of time-splitting Fourier pseudospectral (TSFP) methods for the nonlinear Klein–Gordon equation (NKGE) with weak power-type nonlinearity and O(1) initial data, while the nonlinearity strength is characterized by εp with a constant p ∈ N+ and a dimensionless parameter ε ∈ (0, 1], for the long-time dynamics up to the time at O(ε^{−β}) with 0 ≤ β ≤ p. In fact, when 0 < ε ≪ 1, the problem is equivalent to the long-time dynamics of NKGE with small initial data and O(1) nonlinearity strength, while the amplitude of the initial data (and the solution) is at O(ε). By reformulating the NKGE into a relativistic nonlinear Schr ̈odinger equation, we adapt the TSFP method to discretize it numerically. By using the method of mathematical induction to bound the numerical solution, we prove uniform error bounds at O(h^m + ε^{p−β} τ^2) of the TSFP method with h mesh size, τ time step and m ≥ 2 depending on the regularity of the solution. The error bounds are uniformly accurate for the long-time simulation up to the time at O(ε^{−β}) and uniformly valid for ε ∈ (0, 1]. Especially, the error bounds are uniformly at the second order rate for the large time step τ = O(ε^{−(p−β)/2}) in the parameter regime 0 ≤ β < p. Numerical results are reported to confirm our error bounds in the long-time regime. Finally, the TSFP method and its error bounds are extended to a highly oscillatory complex NKGE which propagates waves with wavelength at O(1) in space and O(ε^β) in time and wave velocity at O(ε^{−β}).

We present two uniformly accurate numerical methods for discretizing the Zakharovsystem (ZS) with a dimensionless parameter 0< ε ≤ 1, which is inversely proportional to theacoustic speed. In the subsonic limit regime, i.e., 0< ε << 1, the solution of ZS propagates waves with O(ε)- andO(1)-wavelengths in time and space, respectively, and/or rapid outgoing initial layerswith speed O(1/ε) in space due to the singular perturbation of the wave operator in ZS and/or theincompatibility of the initial data. By adopting an asymptotic consistent formulation of ZS, wepresent a time-splitting exponential wave integrator (TS-EWI) method via applying a time-splittingtechnique and an exponential wave integrator for temporal derivatives in the nonlinear Schr ̈odingerequation and wave-type equation, respectively. By introducing a multiscale decomposition of ZS, wepropose a time-splitting multiscale time integrator (TS-MTI) method. Both methods are explicitand convergent exponentially in space for all kinds of initial data, which is uniformly for ε ∈ (0,1].The TS-EWI method is simpler to be implemented and it is only uniformly and optimally accuratein time for well-prepared initial data, while the TS-MTI method is uniformly and optimally accuratein time for any kind of initial data. Extensive numerical results are reported to show their efficiencyand accuracy, especially in the subsonic limit regime. Finally, the TS-MTI method is applied tostudy numerically convergence rates of ZS to its limiting models when ε→0+.

Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic framework, <i>geometric structure</i>, to conquer this problem. In order to discover the intrinsic geometric structures of general surfaces, we developed a theoretic rigorous and practical efficient method, <i>Discrete Variational Ricci flow</i>.

In this paper, we present a measure of distance in a second-order cone based on a class of continuously differentiable strictly convex functions on ₊₊. Since the distance function has some favorable properties similar to those of the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]), we refer to it as a quasi D-function. Then, a proximal-like algorithm using the quasi D-function is proposed and applied to the second-cone programming problem, which is to minimize a closed proper convex function with general second-order cone constraints. Like the proximal point algorithm using the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]; Chen and Teboulle in SIAM J. Optim. 3:538543 [1993]), under some mild assumptions we establish the global convergence of the algorithm expressed in terms of function values; we show that the sequence generated by the