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 …

Modeling the behavior of biological tissues and organs often necessitates the knowledge of
their shape in the absence of external loads. However, when their geometry is acquired in …

A one-step analysis of Anderson acceleration with general algorithmic depths is presented.
The resulting residual bounds within both contractive and noncontractive settings reveal the …

Constructing an analysis-suitable parameterization for the computational domain from its
boundary representation plays a crucial role in the isogeometric design-through-analysis …

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 …

There is currently an increasing interest in developing efficient solvers for variational phase-
field models of brittle fracture. The governing equations for this problem originate from a …

Non-rigid 3D registration, which deforms a source 3D shape in a non-rigid way to align with
a target 3D shape, is a classical problem in computer vision. Such problems can be …

In this paper we study computational schemes to simulate freezing and thawing in
permafrost modeled by a nonlinear heat equation with constitutive properties resembling …

We prove convergence of Anderson acceleration for a class of nonsmooth fixed-point
problems for which the nonlinearities can be split into a smooth contractive part and a …

This work is devoted to investigating the computational power of Quasi‐Newton methods in
the context of fast Fourier transform (FFT)‐based computational micromechanics. We revisit …