This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblems, where each updates one, or a small block of, variables while fixing others. These methods can deal with linear and nonlinear mappings, smooth and nonsmooth functions, as well as convex and nonconvex problems. In addition, they are easy to parallelize. The great performance of coordinate update methods depends on solving simple sub-problems. To derive simple subproblems for several new classes of applications, this paper systematically studies coordinate-friendly operators that perform low-cost coordinate updates. Based on the discovered coordinate friendly operators, as well as operator splitting techniques, we obtain new coordinate update algorithms for a variety of problems in machine learning, image processing, as well as sub-areas of optimization. Several problems are treated with coordinate update for the first time in history. The obtained algorithms are scalable to large instances through parallel and even asynchronous computing. We present numerical examples to illustrate how effective these algorithms are.

No abstract uploaded!

H(div) conforming and discontinuous Galerkin (DG) methods are designed for incompressible Euler's equation in two and three dimension. Error estimates are proved for both the semi-discrete method and fully-discrete method using backward Euler time stepping. Numerical examples exhibiting the performance of the methods are given.

Robustness of numerical methods has attracted an increasing interest in the community of computational fluid dynamics. One mathematical aspect of robustness for numerical methods is the positivity-preserving property. At high Mach numbers or for flows near vacuum, solving the conservative Euler equations may generate negative density or internal energy numerically, which may lead to nonlinear instability and crash of the code. This difficulty is particularly profound for high order methods, for multi-material flows and for problems with moving meshes, such as the Lagrangian methods. In this paper, we construct both first order and uniformly high order accurate conservative Lagrangian schemes which preserve positivity of physically positive variables such as density and internal energy in the simulation of compressible multi-material flows with general equations of state (EOS). We first develop a positivity-preserving approximate Riemann solver for the Lagrangian scheme solving compressible Euler equations with both ideal and non ideal EOS. Then we design a class of high order positivity-preserving and conservative Lagrangian schemes by using the essentially non-oscillatory (ENO) reconstruction, the strong stability preserving (SSP) high order time discretizations and the positivity-preserving scaling limiter which can be proven to maintain conservation and uniformly high order accuracy and is easy to implement. One-dimensional and two-dimensional numerical tests for the positivity-preserving Lagrangian schemes are provided to demonstrate the effectiveness of these methods.

We present the application of a low dimensional manifold model (LDMM) on hyperspectral image (HSI) reconstruction. An important property of hyperspectral images is that the patch manifold, which is sampled by the three-dimensional blocks in the data cube, is generally of a low dimensional nature. This is a generalization of low-rank models in that hyperspectral images with nonlinear mixing terms can also fit in this framework. The point integral method (PIM) is used to solve a Laplace-Beltrami equation over a point cloud sampling the patch manifold in LDMM. Both numerical simulations and theoretical analysis show that the sample points constraint is correctly enforced by PIM. The framework is demonstrated by experiments on the reconstruction of both linear and nonlinear mixed hyperspectral images with a significant number of missing voxels and several entirely missing spectral bands.