English
Related papers

Related papers: A method to compute periodic sums

200 papers

Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF…

Numerical Analysis · Computer Science 2015-07-17 Risi Kondor , Nedelina Teneva , Pramod K. Mudrakarta

We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. The spectral sum of an PSD matrix $A$, for a function $f$, is defined as $ \text{Tr}[f(A)] = \sum_j f(\lambda_j)$, where $\lambda_j$…

Quantum Physics · Physics 2024-06-11 Alessandro Luongo , Changpeng Shao

Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…

Computational Geometry · Computer Science 2024-06-17 Guillaume Moroz

Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations,…

Symbolic Computation · Computer Science 2016-08-19 Jakob Ablinger , Arnd Behring , Johannes Bluemlein , Abilio de Freitas , Carsten Schneider

We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…

Complex Variables · Mathematics 2015-03-24 James Nixon

This paper studies stochastic optimization for a sum of compositional functions, where the inner-level function of each summand is coupled with the corresponding summation index. We refer to this family of problems as finite-sum coupled…

Optimization and Control · Mathematics 2023-06-13 Bokun Wang , Tianbao Yang

The uncertainty quantification (UQ) for partial differential equations (PDEs) with random parameters is important for science and engineering. Forward UQ quantifies the impact of random parameters on the solution or the quantity-of-interest…

Numerical Analysis · Mathematics 2025-10-15 Zhao Zhang , Na Ou

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…

Quantum Physics · Physics 2007-05-23 Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf

The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a…

Computational Physics · Physics 2018-01-17 Xingyu Gao , Zeyao Mo , Jun Fang , Han Wang

In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…

Numerical Analysis · Mathematics 2025-07-17 Christian Alber , Peter Bastian , Moritz Hauck , Robert Scheichl

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

Algebraic Geometry · Mathematics 2019-04-24 Emre Can Sertöz

The method of the fundamental solutions (MFS) is used to construct an approximate solution for a partial differential equation in a bounded domain. It is demonstrated by combining the fundamental solutions shifted to the points outside the…

Numerical Analysis · Mathematics 2020-09-30 Shin-Ichiro Ei , Hiroyuki Ochiai , Yoshitaro Tanaka

We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…

Quantum Physics · Physics 2009-11-07 C. D'Helon , V. Protopopescu

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès

We study the colorful sum of radii problem, where the input is a point set $P$ partitioned into classes $P_1, P_2, \dots, P_\omega$, along with per-class outlier bounds $m_1, m_2, \dots, m_\omega$, summing to $m$. The goal is to select a…

Computational Geometry · Computer Science 2025-06-17 Shuilian Liu , Gregory Gutin , Yicheng Xu , Yong Zhang

The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…

Computational Complexity · Computer Science 2023-10-24 Songsong Li , Chaoping Xing

The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…

Classical Analysis and ODEs · Mathematics 2017-10-31 Iosif Pinelis

Large classes of materials systems in physics and engineering are governed by magnetic and electrostatic interactions. Continuum or mesoscale descriptions of such systems can be cast in terms of integral equations, whose direct…

Computational Physics · Physics 2016-08-15 Xikai Jiang , Jiyuan Li , Xujun Zhao , Jian Qin , Dmitry Karpeev , Juan Hernandez-Ortiz , Juan de Pablo , Olle Heinonen

We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…

Symbolic Computation · Computer Science 2018-01-08 Ming-Shing Chen , Chen-Mou Cheng , Po-Chun Kuo , Wen-Ding Li , Bo-Yin Yang

We consider an algorithm to approximate complex-valued periodic functions $f(e^{i\theta})$ as a matrix element of a product of $SU(2)$-valued functions, which underlies so-called quantum signal processing. We prove that the algorithm runs…

Quantum Physics · Physics 2020-05-07 Jeongwan Haah