Fast and robust iterative closest point
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 …
rigid registration between two point sets, with wide applications in different areas from …
Anderson acceleration for fixed-point iterations
HF Walker, P Ni - SIAM Journal on Numerical Analysis, 2011 - SIAM
This paper concerns an acceleration method for fixed-point iterations that originated in work
of DG Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547–560], which we accordingly …
of DG Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547–560], which we accordingly …
Anderson acceleration for geometry optimization and physics simulation
Many computer graphics problems require computing geometric shapes subject to certain
constraints. This often results in non-linear and non-convex optimization problems with …
constraints. This often results in non-linear and non-convex optimization problems with …
Accelerating ADMM for efficient simulation and optimization
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 …
optimization problems that are potentially non-smooth and with hard constraints. It has been …
Convergence Analysis for Restarted Anderson Mixing and Beyond
Anderson mixing (AM) is a classical method that can accelerate fixed-point iterations by
exploring historical information. Despite the successful application of AM in scientific …
exploring historical information. Despite the successful application of AM in scientific …
A hybrid-dimensional coupled pore-network/free-flow model including pore-scale slip and its application to a micromodel experiment
Modeling coupled systems of free flow adjacent to a porous medium by means of fully
resolved Navier–Stokes equations is limited by the immense computational cost and is thus …
resolved Navier–Stokes equations is limited by the immense computational cost and is thus …
Anderson acceleration as a Krylov method with application to asymptotic convergence analysis
Anderson acceleration (AA) is widely used for accelerating the convergence of nonlinear
fixed-point methods $ x_ {k+ 1}= q (x_ {k}) $, $ x_k\in\mathbb {R}^ n $, but little is known …
fixed-point methods $ x_ {k+ 1}= q (x_ {k}) $, $ x_k\in\mathbb {R}^ n $, but little is known …
Linear asymptotic convergence of Anderson acceleration: fixed-point analysis
H De Sterck, Y He - SIAM Journal on Matrix Analysis and Applications, 2022 - SIAM
We study the asymptotic convergence of AA (), ie, Anderson acceleration (AA) with window
size for accelerating fixed-point methods,. Convergence acceleration by AA () has been …
size for accelerating fixed-point methods,. Convergence acceleration by AA () has been …
[HTML][HTML] On the efficient non-linear solver for hydraulic fracturing and well cementing simulations based on Anderson acceleration
The aim of this study is to create a fast and stable iterative technique for numerical solution
of a quasi-linear elliptic pressure equation. We developed a modified version of the …
of a quasi-linear elliptic pressure equation. We developed a modified version of the …
Accelerated Lloyd's Method for Resampling 3D Point Clouds
We present an efficient approach to generating uniformly distributed resampling points of
raw 3D point clouds. A key contribution for making such a resampling method both practical …
raw 3D point clouds. A key contribution for making such a resampling method both practical …