Related papers: A solution to Sheil-Small's harmonic mapping probl…
We propose a fourth-order cut-cell method for solving Poisson's equations in three-dimensional irregular domains. Major distinguishing features of our method include (a) applicable to arbitrarily complex geometries, (b) high order…
We investigate an idealized model for the size reduction and smoothing of a polygonal rock due to repeated chipping at corners. Each chip is sufficiently small so that only a single corner and a fraction of its two adjacent sides are cut…
Symmetric Space Sine-Gordon theories are two-dimensional massive integrable field theories, generalising the Sine-Gordon and Complex Sine-Gordon theories. To study their integrability properties on the real line, it is necessary to…
We consider the problem of triangulating a polygon with $n$ vertices and $h$ holes, or relatedly the problem of computing the trapezoidal decomposition of a collection of $h$ disjoint simple polygonal chains with $n$ vertices total.…
We discuss a recurrent geometrical method, due to \'Elie Cartan and von Weber ([1],[11]) enabling us to determine, step by step, the maximal integral manifolds of a not necessarily integrable nor regular Pfaffian system. The dimensions of…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these…
We study the Hochschild homology of the iterated skew polynomial rings introduced by D. Jordan in ``A simple localization of the quantized Weyl algebra''. First, we obtain a complex, smaller than the canonical one of Hochschild, given the…
The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
Maps from a source manifold $ {\mathcal M}$ to a target manifold ${\mathcal N}$ appear in liquid crystals, colour image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems…
In this paper we apply the newly born choice theory of the shape parameters contained in the smooth radial basis functions to solve Poisson equations. Some people complain that Luh's choice theory, based on harmonic analysis, is…
We consider a version of geometric programming problem consisting in minimizing a function given by the maximum of finitely many log-Laplace transforms of discrete nonnegative measures on a Euclidean space. Under a coerciveness assumption,…
A nonlocal contact problem for two-dimensional linear elliptic equations is stated and investigated. The method of separation of variables is used to find the solution of a stated problem in case of Poisson's equation. Then the more general…
A new approach to building explicit time-marching stencil computation schemes for the transient 2D acoustic wave equation is implemented. It is based on using Poisson's formula and its three time level modification combined with polynomial…
It is well known that the usual mixed method for solving the biharmonic eigenvalue problem by decomposing the operator into two Laplacians may generate spurious eigenvalues on non-convex domains. To overcome this difficulty, we adopt a…
We study interior estimates for solutions of the linear Poisson equation: $$ \triangle u = g u + f $$ where $g$ and $f$ belong to the Zygmund space $L\ln L$ on a Riemann surface $M$ satisfying the isoperimetric inequality. As applications,…
We construct a canonical linear resolution of acyclic 1-dimensional sheaves on P^1 x P^1 and discuss the resulting natural Poisson structure.
Let $T^* = \{P^*_1, \ldots, P^*_N\}$ be a polygonal tiling of a simply connected region in the plane, and let $T = \{P_1, \ldots, P_N\}$ be a noisy version of $T^*$ obtained by making small perturbations to the coordinates of the vertices…
Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…