English
Related papers

Related papers: Exponential sum approximations for $t^{-\beta}$

200 papers

This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and…

Optimization and Control · Mathematics 2011-05-03 Quoc Tran Dinh , Moritz Diehl

The goal of this paper is to understand how exponential-time approximation algorithms can be obtained from existing polynomial-time approximation algorithms, existing parameterized exact algorithms, and existing parameterized approximation…

Data Structures and Algorithms · Computer Science 2023-06-28 Barış Can Esmer , Ariel Kulik , Dániel Marx , Daniel Neuen , Roohani Sharma

Hiary [3] has presented an algorithm which allows to evaluate the truncated theta function $\sum_{k=0}^n \exp(2\pi \i (zk+\tau k^2))$ to within $\pm \epsilon$ in $O(\ln(\tfrac{n}{\epsilon})^{\kappa})$ arithmetic operations for any real $z$…

Number Theory · Mathematics 2014-03-25 Alexey Kuznetsov

Discretization methods for ordinary differential equations based on the use of matrix exponentials have been known for decades. This set of ideas has come off age and acquired greater urgency recently, within the context of geometric…

Numerical Analysis · Mathematics 2025-10-20 Elena Celledoni , Arieh Iserles

We consider analytic functions of the Riemann zeta type, for which, if $s$ is a zero, so is $1-s$. We use infinite product representations of these functions, assuming their zeros to be of first order. We use exponential factors to…

Number Theory · Mathematics 2018-02-20 R. C. McPhedran

We establish asymptotic estimates for the least upper bounds of approximations in the uniform metric by Fourier sums of order $n-1$ of classes of $2\pi$-periodic Weyl--Nagy differentiable functions, $W^r_{\beta,p}, 1\le p\le \infty,…

Classical Analysis and ODEs · Mathematics 2022-02-08 A. S. Serdyuk , I. V. Sokolenko

We obtain estimates exact in order for deviations of Zygmund sums in metrics of spaces $L_{q}$, $1<q<\infty$, on classes of $2\pi$-periodic functions, that admit the representation in the form of convolution of functions that belong to unit…

Classical Analysis and ODEs · Mathematics 2014-05-06 U. Z. Grabova

We present some simple proofs of the well-known expressions for \[ \zeta(2k) = \sum_{m=1}^\infty \frac{1}{m^{2k}}, \qquad \beta(2k+1) = \sum_{m=0}^\infty \frac{(-1)^m}{(2m+1)^{2k+1}}, \] where $k = 1,2,3,\dots$, in terms of the Bernoulli…

Number Theory · Mathematics 2025-01-03 Óscar Ciaurri , Luis M. Navas , Francisco J. Ruiz , Juan L. Varona

Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…

Numerical Analysis · Mathematics 2012-08-06 Michael Brandon Youngberg

We establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…

Optimization and Control · Mathematics 2024-04-12 Yutong Dai , Xiaoyi Qu , Daniel P. Robinson

A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…

Classical Analysis and ODEs · Mathematics 2021-06-04 R B Paris

In this work we present a simple approximation for the Voigt/comp-lex error function based on fitting with set of the exponential functions of form ${\alpha _n}{\left| t \right|^n}{e^{ - {\beta _n}\left| t \right|}}$, where ${\alpha _n}$…

General Mathematics · Mathematics 2018-07-26 S , M. Abrarov , B. M. Quine

Let $\alpha_m$ and $\beta_n$ be two sequences of real numbers supported on $[M, 2M]$ and $[N, 2N]$ with $M = X^{1/2 - \delta}$ and $N = X^{1/2 + \delta}$. We show that there exists a $\delta_0 > 0$ such that the multiplicative convolution…

Number Theory · Mathematics 2018-12-05 Étienne Fouvry , Maksym Radziwiłł

A route to evaluate exact sums represented by Dirichlet eta and beta functions, both of which are alternating and divergent at negative integer arguments, is advocated. It rests on precise polynomial extrapolations and stands as a…

General Mathematics · Mathematics 2019-12-11 Kamal Bhattacharyya

Hardy and Littlewood's approximate functional equation for quadratic Weyl sums (theta sums) provides, by iterative application, a powerful tool for the asymptotic analysis of such sums. The classical Jacobi theta function, on the other…

Number Theory · Mathematics 2015-02-27 Francesco Cellarosi , Jens Marklof

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-07-26 Iosif Pinelis

It is known by a formula of Hasse-Sondow that the Riemann zeta function is given, for any $ s=\sigma+it \in \mathbb{C}$, by $ \sum_{n=0}^{\infty} \widetilde{A}(n,s)$ where $$ \widetilde{A}(n,s):=\frac{1}{2^{n+1}(1-2^{1-s})} \sum_{k=0}^n…

Number Theory · Mathematics 2020-02-10 Yochay Jerby

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

The Bethe approximation, discovered in statistical physics, gives an efficient algorithm called belief propagation (BP) for approximating a partition function. BP empirically gives an accurate approximation for many problems, e.g.,…

Information Theory · Computer Science 2012-10-11 Ryuhei Mori , Toshiyuki Tanaka