Related papers: Numerical integration of discontinuous functions i…
Sometimes it is necessary to obtain a numerical integration using only discretised data. In some cases, the data contains singularities which position is known but does not coincide with a discretisation point, and the jumps in the function…
We provide a new approach for computing integrals over hypersurfaces in the level set framework. The method is based on the discretization (via simple Riemann sums) of the classical formulation used in the level set framework, with the…
Modern multi-core systems have a large number of design parameters, most of which are discrete-valued, and this number is likely to keep increasing as chip complexity rises. Further, the accurate evaluation of a potential design choice is…
We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core…
An explicit second-order numerical method to integrate the isokinetic equations of motion is derived by fitting circular arcs through every three consecutive points of the discretized trajectory, so that the tangent and the curvature…
We propose a parallel version of the cross interpolation algorithm and apply it to calculate high-dimensional integrals motivated by Ising model in quantum physics. In contrast to mainstream approaches, such as Monte Carlo and quasi Monte…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
We introduce a distributed adaptive quadrature method that formulates multidimensional integration as a hierarchical domain decomposition problem on multi-GPU architectures. The integration domain is recursively partitioned into subdomains…
We present the integrand decomposition of multiloop scattering amplitudes in parallel and orthogonal space-time dimensions, $d=d_\parallel+d_\perp$, being $d_\parallel$ the dimension of the parallel space spanned by the legs of the…
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…
In this paper we analyze a greedy procedure to approximate a linear functional defined in a Reproducing Kernel Hilbert Space by nodal values. This procedure computes a quadrature rule which can be applied to general functionals, including…
A new high order accurate semi-implicit space-time Discontinuous Galerkin method on staggered grids, for the simulation of viscous incompressible flows on two-dimensional domains is presented. The designed scheme is of the Arbitrary…
Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit sphere. Functions are approximated to essentially machine precision by using a structure-preserving iterative variant of Gaussian…
This paper is devoted to certain applications of classical Whitney decomposition of the upper half space R^n+1 to various problems in harmonic function spaces in the upper half space.We obtain sharp new assertions on embeddings,distances…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
Clustering, as an unsupervised technique, plays a pivotal role in various data analysis applications. Among clustering algorithms, Spectral Clustering on Euclidean Spaces has been extensively studied. However, with the rapid evolution of…
Inference algorithms based on evolving interactions between replicated solutions are introduced and analyzed on a prototypical NP-hard problem - the capacity of the binary Ising perceptron. The efficiency of the algorithm is examined…
The numerical simulation of the 3D incompressible Euler equation is analyzed with respect to different integration methods. The numerical schemes we considered include spectral methods with different strategies for dealiasing and two…
Many numerical methods for multiscale differential equations require a scale separation between the larger and the smaller scales to achieve accuracy and computational efficiency. In the area of multiscale dynamical systems, so-called,…