Chebyshev Approximation of Completely Monotonic Functions by Sums of Exponentials

DOI10.1137/0713062MaRDI QIDQ4100483zbMATH OpenOpenAlexFDO

Authors David Kammler

Publication date 1976

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0713062

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Approximation by arbitrary linear expressions (41A45) Best approximation, Chebyshev systems (41A50)

Cited in

(11)

• Prony's method for completely monotonic functions
• Approximation by exponential sums on discrete and continuous domains
• Approximation in normed linear spaces
• Phase-type Fitting of scale functions for spectrally negative Lévy processes
• A weak method in numerical identification
• General properties of isoelastic utility economies
• Computation of best \(L^{\infty }\) exponential sums for \(1 / x\) by Remez' algorithm
• Mini-workshop: Multivariate orthogonal polynomials: new synergies with numerical analysis. Abstracts from the mini-workshop held September 25--29, 2023
• Differential approximation of the Gaussian by short cosine sums with exponential error decay
• Uniform approximation of completely monotone functions by exponential sums
• Convergence of exponential interpolation for completely bounded functions

This page was built for publication: Chebyshev Approximation of Completely Monotonic Functions by Sums of Exponentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4100483)