Related papers: A general algorithm for calculating irreducible Br…
We demonstrate a novel mesh of Mach-Zehnder interferometers (MZIs) for programmable optical processors. The proposed mesh, referred to as Bokun mesh, is an architecture that merges the attributes of the prior topologies Diamond and…
We consider the problem of B\'{e}zier curves/surfaces subdivision using blossoms. We propose closed-form formulae for blossoms evaluation, as needed for the calculation of control points. This approach leads to direct and efficient way to…
This article presents a new high-order accurate algorithm for finding a particular solution to a linear, constant-coefficient partial differential equation (PDE) by means of a convolution of the volumetric source function with the Green's…
B\'ezier splines are widely available in various systems with the curves and surface designs. In general, the B\'ezier spline can be specified with the B\'ezier curve segments and a B\'ezier curve segment can be fitted to any number of…
A simple, analytically correct algorithm is developed for calculating pencil beam coordinates using the signals from an ideal cylindrical particle beam position monitor (BPM) with four pickup electrodes (PUEs) of infinitesimal widths. The…
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact…
Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
We present an algorithm for the adaptive tetrahedral integration over the Brillouin zone of crystalline materials, and apply it to compute the optical conductivity, dc conductivity, and thermopower. For these quantities, whose contributions…
Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The…
The Immersed Boundary (IB) method is a mathematical framework for constructing robust numerical methods to study fluid-structure interaction in problems involving an elastic structure immersed in a viscous fluid. The IB formulation uses an…
We consider invertible Bloom lookup tables (IBLTs) which are probabilistic data structures that allow to store keyvalue pairs. An IBLT supports insertion and deletion of key-value pairs, as well as the recovery of all key-value pairs that…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
This paper introduces Bounded Fuzzy Possibilistic Method (BFPM) by addressing several issues that previous clustering/classification methods have not considered. In fuzzy clustering, object's membership values should sum to 1. Hence, any…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
We introduce a computational method to optimize target physical properties in the full configuration space regarding atomic composition, chemical stoichiometry, and crystal structure. The approach combines the universal potential of the…
Symbolic regression that aims to detect underlying data-driven models has become increasingly important for industrial data analysis. For most existing algorithms such as genetic programming (GP), the convergence speed might be too slow for…
A fast numerical algorithm for the evolution of parton distributions in x space is described. The method is close in spirit to `brute' force techniques. The necessary integrals are performed by summing the approximate contributions from…
Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…