Pith. sign in

REVIEW

Exponential sum approximations of finite completely monotonic functions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.08931 v3 pith:KDGOJKEA submitted 2023-01-21 math.NA cs.NA

classification math.NAcs.NA
keywords functioncompletelymonotonicfiniteerrorexponentialfunctionsintegral
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function with a finite positive integral interval of the integral representation. We consider the exponential sum approximation of a finite completely monotonic function based on the Gaussian quadrature with a variable transformation. If the variable transformation is analytic on an open Bernstein ellipse, the maximum absolute error decreases at least geometrically with respect to the number of exponential functions. The maximization of the decreasing rate of the error bound can be achieved by using a variable transformation represented by Jacobi's delta amplitude function (also called dn function). The error curve is expanded by introducing basis functions, which are eigenfunctions of a fourth order differential operator, satisfy orthogonality conditions, and have the interlacing property of zeros by Kellogg's theorem.

Discussion (0). Continue with ORCID to comment.

Pith tools