On Least Squares Exponential Sum Approximation With Positive Coefficients
- 1 January 1980
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 34 (149) , 203-211
- https://doi.org/10.2307/2006228
Abstract
An algorithm is given for finding optimal least squares exponential sum approximations to sampled data subject to the constraint that the coefficients appearing in the exponential sum are positive. The algorithm employs the divided differences of exponentials to overcome certain problems of ill-conditioning and is suitable for data sampled at noninteger times.Keywords
This publication has 9 references indexed in Scilit:
- Nineteen Dubious Ways to Compute the Exponential of a MatrixSIAM Review, 1978
- Numerical Computation of the Matrix Exponential with Accuracy EstimateSIAM Journal on Numerical Analysis, 1977
- Exponential-sum fitting of radiative transmission functionsJournal of Computational Physics, 1977
- Solving Least Squares ProblemsMathematics of Computation, 1976
- Nonlinear Mean-Square Approximation of Finite SetsSIAM Journal on Numerical Analysis, 1975
- Chebyshev Approximation by Exponentials on Finite SubsetsMathematics of Computation, 1973
- On Approximation by Positive Sums of PowersSIAM Journal on Applied Mathematics, 1970
- Approximation mit ExponentialsummenComputing, 1967
- SteigungsmatrizenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1964