Related papers: Efficient Cubature Rules
Modeling of microlensing events poses computational challenges for the resolution of the lens equation and the high dimensionality of the parameter space. In particular, numerical noise represents a severe limitation to fast and efficient…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…
In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…
Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs…
Complex geometries can be easily treated using the well-known full-way and half-way bounce-back rules. However, the accuracy of the full-way bounce-back rule is one order lower than the half-way bounce-back rule. Moreover, when the walls…
Metric search is concerned with the efficient evaluation of queries in metric spaces. In general,a large space of objects is arranged in such a way that, when a further object is presented as a query, those objects most similar to the query…
This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…
Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…
Highly oscillatory integrals of composite type arise in electronic engineering and their calculations is a challenging problem. In this paper, we propose two Gaussian quadrature rules for computing such integrals. The first one is…
This work presents an efficient quadrature rule for shell analysis fully integrated in CAD by means of Isogeometric Analysis (IGA). General CAD-models may consist of trimmed parts such as holes, intersections, cut-offs etc. Therefore, IGA…
It was pointed out in Crisan, Ghazali [2] that the error estimate for the cubature on Wiener space algorithm developed in Lyons, Victoir [11] requires an additional assumption on the drift. In this note we demonstrate that it is…
This article is part of a collection that strives to collect and provide in an unified form data about all the critical points on the scalar manifold of SO(8)-gauged N=8 supergravity in four dimensions known so far. The vast majority of…
The clustering problem has many applications in Machine Learning, Operations Research, and Statistics. We propose three algorithms to create starting solutions for improvement algorithms for this problem. We test the algorithms on 72…
In this article, quadrature rules for the efficient computation of the stiffness matrix for the fractional Laplacian in three dimensions are presented. These rules are based on the Duffy transformation, which is a common tool for…
Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…
Particle methods are widely used because they can provide accurate descriptions of evolving measures. Recently it has become clear that by stepping outside the Monte Carlo paradigm these methods can be of higher order with effective and…
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties of the kernel with recombination results about point measures. This results in effective algorithms that construct convex quadrature rules…
We prove upper bounds on the order of convergence of Frolov's cubature formula for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
In this note, we study a concatenation of quasi-Monte Carlo and plain Monte Carlo rules for high-dimensional numerical integration in weighted function spaces. In particular, we consider approximating the integral of periodic functions…