Related papers: An improved algorithm and a Fortran 90 module for …
We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm has an error bound exponent of only log 4 $\gamma$$\infty$,2 $\approx$ 2.386.…
It has recently been emphasized that all known exact evaluations of gap probabilities for classical unitary matrix ensembles are in fact $\tau$-functions for certain Painlev\'e systems. We show that all exact evaluations of gap…
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for…
Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…
The Condat-V\~u algorithm is a widely used primal-dual method for optimizing composite objectives of three functions. Several algorithms for optimizing composite objectives of two functions are special cases of Condat-V\~u, including…
Niederreiter [H.Niederreiter, Error bounds for quasi-Monte Carlo integration with uniform point sets, Journal of computational and applied mathematics 150 (2003), 283-292] established new bounds for quasi-Monte Carlo integration for nodes…
Modern particle physics is increasingly becoming a precision science that relies on advanced theoretical predictions for the analysis and interpretation of experimental results. The planned physics program at the LHC and future colliders…
Inverse problems are prevalent in numerous scientific and engineering disciplines, where the objective is to determine unknown parameters within a physical system using indirect measurements or observations. The inherent challenge lies in…
Feynman loop integrals are a key ingredient for the calculation of higher order radiation effects, and are responsible for reliable and accurate theoretical prediction. We improve the efficiency of numerical integration in sector…
We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…
This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…
Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…
We present a double precision routine in Fortran for the precise and fast numerical evaluation of the two Master Integrals (MIs) of the equal mass two-loop sunrise graph for arbitrary momentum transfer in d=2 and d=4 dimensions. The routine…
We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone. A consequence is that the weak membership or membership problem…
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…
We study a Monte Carlo algorithm that is based on a specific (randomly shifted and dilated) lattice point set. The main result of this paper is that the mean squared error for a given compactly supported, square-integrable function is…
We report an essential improvement of the plain Fourier Monte Carlo algorithm that promises to be a powerful tool for investigating critical behavior in a large class of lattice models, in particular those containing microscopic or…
Numerical reconstruction techniques are widely employed in the calculation of multi-loop scattering amplitudes. In recent years, it has been observed that the rational functions in multi-loop calculations greatly simplify under partial…
We consider the problem of efficiently computing isolated coefficients $c_n$ in the Fourier series of the elliptic modular function $j(\tau)$. We show that a hybrid numerical-modular method with complexity $n^{1+o(1)}$ is efficient in…
This paper presents Dual Lagrangian Learning (DLL), a principled learning methodology for dual conic optimization proxies. DLL leverages conic duality and the representation power of ML models to provide high-duality, dual-feasible…