|
Numerical methods and programming, 2003, Volume 4, Issue 1, Pages 167–171
(Mi vmp710)
|
|
|
|
A least squares method for sums of functions satisfying the differential
equations with polynomial coefficients
O. I. Berngardt, A. L. Voronov Institute of Solar-Terrestrial Physics, Irkutsk
Abstract:
We propose a linear algorithm for determining the parameters of two functions
on the basis of their linear combination. These functions must satisfy
first-order differential equations with polynomial coefficients, whereas the
parameters to be found are the coefficients of these polynomials. The
algorithm is based on the least squares method and consists of sequential
solution of the following two linear problems: determining the coefficients
of polynomial terms in the differential equation satisfied by a linear
combination of two given functions and determining the function parameters
with the use of these polynomial coefficients. Numerical results obtained
according to the above scheme confirm good performance of our method
under weak normal noise (with dispersion less than 3 per cent)
Keywords:
least squares method, differential equations, linearity, noisy systems.
Citation:
O. I. Berngardt, A. L. Voronov, “A least squares method for sums of functions satisfying the differential
equations with polynomial coefficients”, Num. Meth. Prog., 4:1 (2003), 167–171
Linking options:
https://www.mathnet.ru/eng/vmp710 https://www.mathnet.ru/eng/vmp/v4/i1/p167
|
Statistics & downloads: |
Abstract page: | 90 | Full-text PDF : | 34 |
|