Related papers: Calculating power integral bases by solving relati…
We provide algorithms computing power series solutions of a large class of differential or $q$-differential equations or systems. Their number of arithmetic operations grows linearly with the precision, up to logarithmic terms.
Starting with a general discussion, a program is sketched for a quantization based on dilations. This resolving-power quantization is simplest for scalar field theories. The hope is to find a way to relax the requirement of locality so that…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
In this paper, we propose a numerical method for computing Hadamard finite-part integrals with an integral-power singularity at an endpoint, the part of the divergent integral which is finite as a limiting procedure. In the proposed method,…
We consider in this work quantities that can be obtained as limits of powers of parametrized matrices, for instance the inverse matrix or the logarithm of the determinant. Under the assumption of affine dependence in the parameters, we use…
The power method is a basic method for computing the dominant eigenpair of a matrix. In this paper, we propose a structure-preserving power-like method for computing the dominant conjugate pair of purely imaginary eigenvalues and the…
We consider the problem of finding a low rank symmetric matrix satisfying a system of linear equations, as appears in phase retrieval. In particular, we solve the gauge dual formulation, but use a fast approximation of the spectral…
Using a pointwise version of Fej\'{e}r's theorem about Fourier series, we obtain two formulae related to the series representations of positive integral powers of $\pi$. We also check the correctness of our formulae by the applications of…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state…
We present several sequences involving harmonic numbers and the central binomial coefficients. The calculational technique is consists of a special summation method that allows, based on proper two-valued integer functions, to calculate…
To each non totally real cubic extension $K$ of $\Q$ and to each generator $\alpha$ of the cubic field $K$, we attach a family of cubic Thue equations, indexed by the units of $K$, and we prove that this family of cubic Thue equations has…
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…
Let $F(x,y)$ be an irreducible binary form of degree $\geq 3$ with integer coefficients and with real roots. Let $M$ be an imaginary quadratic field, with ring of integers $Z_M$. Let $K>0$. We describe an efficient method how to reduce the…
We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…
We study the computation of equilibrium points of electrostatic potentials: locations in space where the electrostatic force arising from a collection of charged particles vanishes. This is a novel scenario of optimization in which…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
Using N=1 superspace techniques in four dimensions we show how to perturbatively compute the superpotential generated for the glueball superfield upon integrating out massive charged fields. The technique applies to arbitrary gauge groups…