Related papers: The Curvature-Augmented Closest Point Method with …
A new approach for simulating flows over complex geometries is developed by introducing an accurate virtual interpolation point scheme as well as a virtual local stencil approach. The present method is based on the concept of point…
In this work, we propose an extension of the mixed Virtual Element Method (VEM) for bi-dimensional computational grids with curvilinear edge elements. The approximation by means of rectilinear edges of a domain with curvilinear geometrical…
In this paper we construct a parametrization-free embedding technique for numerically evolving reaction-diffusion PDEs defined on algebraic curves that possess an isolated singularity. In our approach, we first desingularize the curve by…
We establish convergence results for a spatial semidiscretization of Mean Curvature Flow (MCF) for surfaces with fixed boundaries. Our analysis is based on Huisken's evolution equations for the mean curvature and the normal vector, enabling…
By employing the closest point method, we extend the applicability of minimizing movements to the surface PDE setting. The corresponding approximation methods are created, and their convergence is observed. The numerical methods are then…
This paper presents smoothing schemes for obtaining approximate stationary points of unconstrained or linearly-constrained composite nonconvex-concave min-max (and hence nonsmooth) problems by applying well-known algorithms to composite…
We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…
The maximum principle is one of the most important tools in the analysis of geometric partial differential equations. Traditionally, the maximum principle is applied to a scalar function defined on a manifold, but in recent years more…
We consider an optimal recovery problem for the Poisson problem when the boundary data is unknown. Compensating information is provided in the form of a finite number of measurements of the solution. A finite element algorithm for this…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
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…
The DD-CPM software library provides a set of tools for the discretization and solution of problems arising from the closest point method (CPM) for partial differential equations on surfaces. The solvers are built on top of the well-known…
We propose to augment standard grid-based fluid solvers with pointwise divergence-free velocity interpolation, thereby ensuring exact incompressibility down to the sub-cell level. Our method takes as input a discretely divergence-free…
We use the concept of barrier-based smoothing approximations introduced in [ C. B. Chua and Z. Li, A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones, SIOPT 23(2), 2010] to extend the non-interior…
We consider prescribed mean curvature equations whose solutions are minimal surfaces, constant mean curvature surfaces, or capillary surfaces. We consider both Dirichlet boundary conditions for Plateau problems and nonlinear Neumann…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…
We estimate best-approximation errors using vector-valued finite elements for fields with low regularity in the scale of fractional-order Sobolev spaces. By assuming additionally that the target field has a curl or divergence property, we…
We propose a two-level structural optimization method for obtaining an approximate optimal shape of piecewise developable surface without specifying internal boundaries between surface patches. The condition for developability of a…
We propose and analyze an unfitted finite element method for solving elliptic problems on domains with curved boundaries and interfaces. The approximation space on the whole domain is obtained by the direct extension of the finite element…
The adaptive partition of unity interpolation method, introduced by Aiton and Driscoll, using Chebyshev local interpolants, is explored for interpolating functions with sharp gradients representing two-medium problems. For functions that…