Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
80/2017

Computation of Best $L^{\infty}$ Exponential Sums for $1/x$ by Remez' Algorithm

Wolfgang Hackbusch

Abstract

The approximation of the function $1/x$ by exponential sums has several interesting applications. It is well known that best approximations with respect to the maximum norm exist. Moreover, the error estimates exhibit exponential decay as the number of terms increases. Here we focus on the computation of the best approximations. In principle, the problem can be solved by the Remez algorithm, however, because of the very sensitive behaviour of the problem the standard approach fails for a larger number of terms. The remedy described in the paper is the use of other independent variables of the exponential sum. We discuss the approximation error of the computed exponential sums up to 63 terms and hint to a webpage containing the corresponding coefficients.

Received:
Dec 18, 2017
Published:
Dec 19, 2017
MSC Codes:
41A50, 65D15
Keywords:
exponential sums, Remez algorithm, uniform best approximation

Related publications

inJournal
2019 Journal Open Access
Wolfgang Hackbusch

Computation of best \(L^ \mathscr{\infty} \) exponential sums for \(1/x\) by Remez algorithm

In: Computing and visualization in science, 20 (2019) 1-2, pp. 1-11