The iterative closest point (ICP) algorithm and its variants are a fundamental technique for
rigid registration between two point sets, with wide applications in different areas from …

Many computer graphics problems require computing geometric shapes subject to certain
constraints. This often results in non-linear and non-convex optimization problems with …

The alternating direction method of multipliers (ADMM) is a popular approach for solving
optimization problems that are potentially non-smooth and with hard constraints. It has been …

This book presents a systematic methodology for the development of parallel multi-physics
models and its implementation in geophysical and biomedical applications. The …

Picard Iteration is a widely used coupling method for multiphysics simulations. This method
allows one to directly leverage existing and well-developed single-physics programs without …

The Anderson acceleration method is an algorithm for accelerating the convergence of fixed-
point iterations, including the Picard method. Anderson acceleration was first proposed in …

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 …

In this paper, a nonlinear positivity-preserving finite volume scheme for the heterogeneous
and anisotropic diffusion problems is proposed. Firstly, a linear diamond finite volume …

This work evaluates the benefits of using the Anderson acceleration method in a finite
volume context to solve convective-dominant power-law non-Newtonian fluid flows. We use …

We present in this article a positive finite volume method for diffusion equation on deformed
meshes. This method is mainly inspired from, and uses auxiliary unknowns at the nodes of …