Related papers: Provably size-guaranteed mesh generation with supe…
An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on…
Out of the recent advances in systems and control (S\&C)-based analysis of optimization algorithms, not enough work has been specifically dedicated to machine learning (ML) algorithms and its applications. This paper addresses this gap by…
Over the last few decades, the numerical methods for stochastic differential delay equations (SDDEs) have been investigated and developed by many scholars. Nevertheless, there is still little work to be completed. By virtue of the novel…
I present a generalization of Chew's first algorithm for Delaunay mesh refinement. In his algorithm, Chew splits the line segments of the input planar straight line graph (PSLG) into shorter subsegments whose lengths are nearly identical.…
This paper is concerned with superconvergence properties of a class of finite volume methods of arbitrary order over rectangular meshes. Our main result is to prove {\it 2k-conjecture}: at each vertex of the underlying rectangular mesh, the…
We study the statistical mechanics of classical Coulomb systems in a low coupling regime (Debye-Huckel regime) in a confined geometry with Dirichlet boundary conditions. We use a method recently developed by the authors which relates the…
For the prescribed scalar curvature equation on $S^n$ ($n \ge 6$), we consider the situation where the number of bubbles tends to infinity in the Lyapunov-Schmidt (finite dimension) reduction method. In an outstanding paper by Wei and Yan,…
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
For unconstrained control problems, a local convergence rate is established for an $hp$-method based on collocation at the Radau quadrature points in each mesh interval of the discretization. If the continuous problem has a sufficiently…
This paper concerns with mesh restrictions that are needed to satisfy several important mathematical properties -- maximum principles, comparison principles, and the non-negative constraint -- for a general linear second-order elliptic…
Delaunay triangulations provide a bijection between a set of $N+3$ points in the complex plane, and the set of triangulations with given circumcircle intersection angles. The uniform Lebesgue measure on these angles translates into a…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
In this thesis a connection between the worlds of discrete and continuous conformal geometry is explored. Specifically, a disk pattern production theroem is proved using an energy which measures how ``uniform'' the angle data of a…
We argue that there exists a new class of completely smooth 1/8-BPS, three-charge bound state configurations that depend upon arbitrary functions of two variables. These configurations are locally 1/2-BPS objects in that if they form an…
We consider inhomogeneous branching diffusions on an infinite domain of $\mathbb{R}^d$. The first aim of this article is to derive a general criterium under which the size process (number of particles) and the genealogy of the particle…
A continuum description of unstructured meshes in two dimensions, both for planar and curved surface domains, is proposed. The meshes described are those which, in the limit of an increasingly finer mesh (smaller cells), and away from…
This paper provides a comprehensive guide to generating unconstrained, simplicial, four-dimensional (4D), hypervolume meshes for space-time applications. While several universal procedures for constructing unconstrained, d-dimensional,…
We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…
Optimally convergent (with respect to the regularity) quadratic finite element method for two dimensional obstacle problem on simplicial meshes is studied in (Brezzi, Hager, Raviart, Numer. Math, 28:431--443, 1977). There was no analogue of…