Related papers: A high-order fully Lagrangian particle level-set m…
A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this…
Simultaneous localization and mapping (SLAM) based on particle filtering has been extensively employed in indoor scenarios due to its high efficiency. However, in geometry feature-less scenes, the accuracy is severely reduced due to lack of…
We introduce a method based on Gaussian process regression to identify discrete variational principles from observed solutions of a field theory. The method is based on the data-based identification of a discrete Lagrangian density. It is a…
A variational method is used to derive a self-consistent macro-particle model for relativistic electromagnetic kinetic plasma simulations. Extending earlier work [E. G. Evstatiev and B. A. Shadwick, J. Comput. Phys., vol. 245, pp. 376-398,…
Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…
In this work we introduce a category of discrete Lagrange--Poincare systems LP_d and study some of its properties. In particular, we show that the discrete mechanical systems and the discrete mechanical systems obtained by the Lagrangian…
Robust fine-tuning aims to adapt large foundation models to downstream tasks while preserving their robustness to distribution shifts. Existing methods primarily focus on constraining and projecting current model towards the pre-trained…
We propose a second order, fully semi-Lagrangian method for the numerical solution of systems of advection-diffusion-reaction equations, which employs a semi-Lagrangian approach to approximate in time both the advective and the diffusive…
To reduce cost in storing, processing and visualizing a large-scale point cloud, we consider a randomized resampling strategy to select a representative subset of points while preserving application-dependent features. The proposed strategy…
Efficient transport algorithms are essential to the numerical resolution of incompressible fluid flow problems. Semi-Lagrangian methods are widely used in grid based methods to achieve this aim. The accuracy of the interpolation strategy…
In this paper, we present a surface remeshing method with high approximation quality based on Principal Component Analysis. Given a triangular mesh and a user assigned polygon/vertex budget, traditional methods usually require the extra…
High-resolution simulations of particle-based kinetic plasma models typically require a high number of particles and thus often become computationally intractable. This is exacerbated in multi-query simulations, where the problem depends on…
In this paper, we propose a novel recovery based finite element method for the Cahn-Hilliard equation. One distinguishing feature of the method is that we discretize the fourth-order differential operator in a standard $C^0$ linear finite…
The recent success of 3D Gaussian Splatting (3DGS) has reshaped novel view synthesis by enabling fast optimization and real-time rendering of high-quality radiance fields. However, it relies on simplified, order-dependent alpha blending and…
Partial differential equations (PDEs) on surfaces appear in many applications throughout the natural and applied sciences. The classical closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is an embedding…
In high-dimensional statistics, variable selection recovers the latent sparse patterns from all possible covariate combinations. This paper proposes a novel optimization method to solve the exact L0-regularized regression problem, which is…
We present a framework for solving partial different equations on evolving surfaces. Based on the grid-based particle method (GBPM) [18], the method can naturally resample the surface even under large deformation from the motion law. We…
The accurate reconstruction of dynamic street scenes is critical for applications in autonomous driving, augmented reality, and virtual reality. Traditional methods relying on dense point clouds and triangular meshes struggle with moving…
We propose a novel method for 3D object reconstruction from a sparse set of views captured from a 360-degree calibrated camera rig. We represent the object surface through a hybrid model that uses both an MLP-based neural representation and…
We introduce a globally convergent relaxed Kacanov scheme for the computation of the discrete minimizer to the $p$-Laplace problem with $2 \leq p < \infty$. The iterative scheme is easy to implement since each iterate results only from the…