Least Squares Approximation of Completely Monotonic Functions by Sums of Exponentials
DOI10.1137/0716060zbMATH Open0444.41012OpenAlexW2067526476MaRDI QIDQ3887902FDOQ3887902
Authors: David Kammler
Publication date: 1979
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0716060
sums of exponentialsmonosplinesnonlinear interpolationL2-approximation of completely monotonic functions
Spline approximation (41A15) Approximation by other special function classes (41A30) Uniqueness of best approximation (41A52)
Cited In (10)
- Constitutive fractional modeling
- Title not available (Why is that?)
- A weak method in numerical identification
- A sufficient condition for the rapid convergence of differential approximation
- The \(n\)-fold convolution of generalized exponential-sum distribution functions
- A review of the parameter estimation problem of fitting positive exponential sums to empirical data
- A kernel-independent sum-of-Gaussians method by de La Vallée-Poussin sums
- Fitting distribution-like data to exponential sums with genetic algorithms
- Computation of best \(L^{\infty }\) exponential sums for \(1 / x\) by Remez' algorithm
- Chained aggregation model with minimum truncation error
This page was built for publication: Least Squares 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 Q3887902)