Related papers: A high-order fully Lagrangian particle level-set m…
We analyze a novel multi-level version of a recently introduced compressed sensing (CS) Petrov-Galerkin (PG) method from [H. Rauhut and Ch. Schwab: Compressive Sensing Petrov-Galerkin approximation of high-dimensional parametric operator…
We study the finite element approximation of linear second-order elliptic partial differential equations in nondivergence form with highly heterogeneous diffusion and drift coefficients. A generalized Cordes condition is imposed to…
Particle-based methods are a practical tool in computational fluid dynamics, and novel types of methods have been proposed. However, widely developed Lagrangian-type formulations suffer from the nonuniform distribution of particles, which…
We propose a variational functional and fast algorithms to reconstruct implicit surface from point cloud data with a curvature constraint. The minimizing functional balances the distance function from the point cloud and the mean curvature…
A new concept for the higher-order accurate approximation of partial differential equations on manifolds is proposed where a surface mesh composed by higher-order elements is automatically generated based on level-set data. Thereby, it…
In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently…
We present a new high order finite element method for the discretization of partial differential equations on stationary smooth surfaces which are implicitly described as the zero level of a level set function. The discretization is based…
In this paper we genealize the fast semi-Lagrangian scheme developed in [J. Comput. Phys., Vol. 255, 2013, pp 680-698] to the case of high order reconstructions of the distribution function. The original first order accurate semi-Lagrangian…
For linear and fully non-linear diffusion equations of Bellman-Isaacs type, we introduce a class of approximation schemes based on differencing and interpolation. As opposed to classical numerical methods, these schemes work for general…
This paper presents a novel algorithm that leverages Stochastic Gradient Descent strategies in conjunction with Random Features to augment the scalability of Conic Particle Gradient Descent (CPGD) specifically tailored for solving sparse…
The recent years have witnessed advances in parallel algorithms for large scale optimization problems. Notwithstanding demonstrated success, existing algorithms that parallelize over features are usually limited by divergence issues under…
The Cahn-Hilliard system has been used to describe a wide number of phase separation processes, from co-polymer systems to lipid membranes. In this work the convergence properties of a closest-point based scheme is investigated. In place of…
Since the seminal work of Idelsohn, O\~nate and Del-Pin (2004), the Particle Finite Element Method (PFEM) has relied on a Delaunay triangulation and the Alpha--Shape (AS) algorithm in the remeshing process. This approach guarantees a good…
This paper studies a class of double-loop (inner-outer) algorithms for convex composite optimization. For unconstrained problems, we develop a restarted accelerated composite gradient method that attains the optimal first-order complexity…
The paper proposes an approach for the efficient model order reduction of dynamic contact problems in linear elasticity. Instead of the augmented Lagrangian method that is widely used for mechanical contact problems, we prefer here the…
A numerical model and parallel software for 3D simulations of granular flows have been developed based on the Lagrangian particle (LP) method [R.Samulyak, X. Wang, H.-C. Chen, Lagrangian particle method for compressible fluid dynamics, J.…
We present a detail-driven deep neural network for point set upsampling. A high-resolution point set is essential for point-based rendering and surface reconstruction. Inspired by the recent success of neural image super-resolution…
A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a…
3D point clouds acquired by scanning real-world objects or scenes have found a wide range of applications including immersive telepresence, autonomous driving, surveillance, etc. They are often perturbed by noise or suffer from low density,…
We propose a new representation of visual data that disentangles object position from appearance. Our method, termed Deep Latent Particles (DLP), decomposes the visual input into low-dimensional latent ``particles'', where each particle is…