Approximation by short exponential sums with geometric error decay based on Gauss quadrature

Abstract

We present new short exponential sum approximations of length N for f1(x)=1a+x with a>0 on [0, ∞) and for f2(x)= e-x2/2σ with σ>0 on R with geometric error decay ρ-2N for user-defined N 2 and ρ>1. The approximations are built over consecutive intervals [bj, \, bj+1) ⊂ [0, ∞), j ∈ N0, with interval lengths that depend on ρ and grow exponentially for f1 and are equidistant for f2. All parameters determining the exponential sum approximations on [bj, \, bj+1) are easily computed from the initial parameters on [b0, \, b1), ensuring numerical stability. Our method is based on Gauss-Laguerre and Gauss-Hermite quadrature, respectively, applied to suitable parametric integral representations of f1 and f2. This technique ensures consistent relative errors across all intervals. Using the obtained exponential sum approximations, we achieve highly accurate approximations of (x) on [1,∞) and of the error function erf(x) with predictable geometric error decay. Numerical examples for N=8 and N=10 clearly illustrate the theoretical error estimates.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…