Related papers: Commuting Extensions and Cubature Formulae
It is a widely held view that analytical integration is more accurate than the numerical one. In some special cases, however, numerical integration can be more advantageous than analytical integration. In our paper we show this benefit for…
We discuss a practical method to compute the self-force on a particle moving through a curved spacetime. This method involves two expansions to calculate the self-force, one arising from the particle's immediate past and the other from the…
We review a simple but instructive application of the formalism of covariant bitensors, to use a deviation vector field along a fiducial geodesic to describe a neighboring worldline, in an exact and manifestly covariant manner, via the…
Typical dualities in arbitrary dimensions are understood through a Hilbert-space extension method. By these results, we rigorously dualize the quantum ingappabilities to discrete height model in one dimension which is inaccessible by…
We propose new weak error bounds and expansion in dimension one for optimal quantization-based cubature formula for different classes of functions, such that piecewise affine functions, Lipschitz convex functions or differentiable function…
In boundary integral methods it is often necessary to evaluate layer potentials on or close to the boundary, where the underlying integral is difficult to evaluate numerically. Quadrature by expansion (QBX) is a new method for dealing with…
A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…
The purpose of this paper is to develop the anti-Gauss cubature rule for approximating integrals defined on the square whose integrand function may have algebraic singularities at the boundaries. An application of such a rule to the…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
We develop a comprehensive theory of phase for finite-dimensional quantum systems. The only physical requirement we impose is that phase is complementary to amplitude. To implement this complementarity we use the notion of mutually unbiased…
We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The method can be used to compute a nested sequence of quadrature…
The growing field of large-scale time domain astronomy requires methods for probabilistic data analysis that are computationally tractable, even with large datasets. Gaussian Processes are a popular class of models used for this purpose…
Let $(M,g)$ be a Riemannian manifold, and $m$ be a second metric on $M$. We give expressions of $m$'s associated connection, and Riemann curvature tensor $R_m$, in terms of $R_g$ and certain combinations of covariant derivatives of $m$…
In this paper, we introduce the cubature formula for Stochastic Volterra Integral Equations. We first derive the stochastic Taylor expansion in this setting, by utilizing a functional It\^{o} formula, and provide its tail estimates. We then…
We apply the methods of \cite{Alexandrov:2023zjb} to compute generating series of D4D2D0 indices with a single unit of D4 charge for several compact Calabi-Yau threefolds, assuming modularity of these indices. Our examples include a…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…
We describe two main classes of one-sided trigonometric and hyperbolic Jacobi-type algorithms for computing eigenvalues and eigenvectors of Hermitian matrices. These types of algorithms exhibit significant advantages over many other…
We present a systematic computational framework for generating positive quadrature rules in multiple dimensions on general geometries. A direct moment-matching formulation that enforces exact integration on polynomial subspaces yields…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We propose a Jacobi-style distributed algorithm to solve convex, quadratically constrained quadratic programs (QCQPs), which arise from a broad range of applications. While small to medium-sized convex QCQPs can be solved efficiently by…