Related papers: Numerical computation of triangular complex spheri…
Cubature rules on the triangle have been extensively studied, as they are of great practical interest in numerical analysis. In most cases, the process by which new rules are obtained does not preclude the existence of similar rules with…
Given a finite subset of a sphere or projective space, known as a design, we can compute the strength and angle set of that design. When the strength and angle set meet certain bounds, the design is called tight. Hoggar sought to prove…
The triangular ratio metric is studied in a domain $G\subsetneq\mathbb{R}^n$, $n\geq2$. Several sharp bounds are proven for this metric, especially, in the case where the domain is the unit disk of the complex plane. The results are applied…
A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…
We present algorithms for computing strongly singular and near-singular surface integrals over curved triangular patches, based on singularity subtraction, the continuation approach, and transplanted Gauss quadrature. We demonstrate the…
A small triangulation of the sphere product can be found in lower dimensions by computer search and is known in few other cases: Klee and Novik constructed a centrally symmetric triangulation of $\mathbb{S}^i\times \mathbb{S}^{d-i-1}$ with…
The paper describes and classifies hexagonal circular 3-webs on unit sphere such that the polar points of the web circles lie on a twisted cubic, thus completing classification of hexagonal circular 3-webs with algebraic polar curves of…
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…
Spherical coverings on the S2 sphere and their algebraic numbers are given for the putatively optimal global solutions for some n-congruent spherical caps with minimal radius to completely cover the S2 sphere. A few locally optimal…
A new numerical approach is proposed for the simulation of coupled three-dimensional and one-dimensional elliptic equations (3D-1D coupling) arising from dimensionality reduction of 3D-3D problems with thin inclusions. The method is based…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
Optimal block designs in small blocks are explored when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first develop an approximate theory which leads to a convenient multiplicative…
The aim of this paper is to highlight recent progress in using conic optimization methods to study geometric packing problems. We will look at four geometric packing problems of different kinds: two on the unit sphere -- the kissing number…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
Several problems in magnetically confined fusion, such as the computation of exterior vacuum fields or the decomposition of the total magnetic field into separate contributions from the plasma and the external sources, are best formulated…
Epsilon-nets and approximate unitary $t$-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. The former constitute subsets of unitary…
Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…
Detailed numerical results for the structural properties of three-dimensional classical Coulomb clusters confined in a spherical parabolic trap are presented. Based on extensive high accuracy computer simulations the shell configurations…
It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…
The tropical variety of a $d$-dimensional prime ideal in a polynomial ring with complex coefficients is a pure $d$-dimensional polyhedral fan. This fan is shown to be connected in codimension one. We present algorithmic tools for computing…