The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to converge to a solution of high‐accuracy. Previously, Anderson acceleration has been applied to ADMM, by treating it as a fixed‐point iteration for the concatenation of the dual variables and a subset of the primal variables. In this paper, we note that the equivalence between ADMM and Douglas‐Rachford splitting reveals that ADMM is in fact a fixed‐point iteration in a lower‐dimensional space. By applying Anderson acceleration to such lower‐dimensional fixed‐point iteration, we obtain a more effective approach for accelerating ADMM. We analyze the convergence of the proposed acceleration method on nonconvex problems, and verify its effectiveness on a variety of computer graphics including geometry processing and physical simulation.

Heavy Snow will turn to a natural disaster, and will bring big economic losses. The authors hope to establish a mathematic model and a plan to illustrate how to sweep off the snow on main roads in a city so as to ensure the smooth flow of traffic. The research will become a basis on which the government can workout some plans against the snow disasters. Firstly we made some assumptions, then studied the working process of snow-sweepers and derived a snow sweeping model. Based on this model, the relationship between working speed of snow-sweeper and snow thickness, a working model of snow-sweeper, and minimum sets of snow-sweeper needed were established. A deep-searching model and a model of snow-sweeping tree, and a computer program in PASCAL to determine the minimum number of snow-sweeper and the snow sweeping plans on main roads were obtained. We tried several solutions to deal with this problem, such as using piecewise curve fitting to transform a formula h~ vc relating to a cubic equation operation to formula vc~ h ,using trial and error method to determine the minimum number of snow sweepers, using deep searching and tree structure in one-stroke processing in a complicated two-way road system, and also a matrix to deal with the deep searching.

The definition of quasi-local mass for a bounded space-like region in space-time is essential in several major unsettled roblems in general relativity. The quasi-local mass is expected to be a type of flux integral on the boundary two-surface $ \sum = \partial \Omega $ and should be independent of whichever space-like region $\sum $ bounds. An important idea which is related to the Hamiltonian formulation of general relativity is to consider a reference surface in a flat ambient space with the same first fundamental form and derive the quasi-local mass from the difference of the extrinsic geometries. This approach has be taken by Brown-York [4][5] and Liu-Yau [16][17] (see also related works [12], [15], [6], [14], [3], [9], [28], [32]) to define such notions using the isometric embedding theorem into the Euclidean three space. However, there exist surfaces in the Minkowski space whose quasilocal mass is strictly positive [19]. It appears that the momentum information needs to accounted for to reconcile the difference. In order to fully capture this information, we use isometric embeddings into the Minkowski space as references. In this article, we first prove an existence and uniqueness theorem for such isometric embeddings. We then solve the boundary value problem for Jang’s [13] equation as a procedure to recognize such a surface in the Minkowski space. In doing so, we discover new expression of quasi-local mass for a large class of “admissible” surfaces (see Theorem A and Remark 1.1). The new mass is positive when the ambient space-time satisfies the dominant energy condition and vanishes on surfaces in the Minkowski space. It also has the nice asymptotic behavior at spatial infinity and null infinity. Some of these results were announced in [29].

Surface parameterizations have been widely applied to digital geometry processing. In this paper, we propose an efficient conformal energy minimization (CEM) algorithm for computing conformal parameterizations of simply-connected open surfaces with a very small angular distortion and a highly improved computational efficiency. In addition, we generalize the proposed CEM algorithm to computing conformal parameterizations of multiply-connected surfaces. Furthermore, we prove the existence of a nontrivial accumulation point of the proposed CEM algorithm under some mild conditions. Several numerical results show the efficiency and robustness of the CEM algorithm comparing to the existing state-of-the-art algorithms. An application of the CEM on the surface morphing between simply-connected open surfaces is demonstrated thereafter. Thanks to the CEM algorithm, the whole computations for the surface morphing can be performed efficiently and robustly.

This paper is a contribution to the general problem of giving an explicit description of the basic locus in the reduction modulo $p$ of Shimura varieties. Motivated by \cite{Vollaard-Wedhorn} and \cite{Rapoport-Terstiege-Wilson}, we classify the cases where the basic locus is (in a natural way) the union of classical Deligne-Lusztig sets associated to Coxeter elements. We show that if this is satisfied, then the Newton strata and Ekedahl-Oort strata have many nice properties.