07

NANOSYSTEMS: PHYSICS, CHEMISTRY, MATHEMATICS, 2014, 5 (3), P. 384–390

RELATIONSHIP PLURALITY APPROXIMATION

V. D. Lukyanov – JSC Avangard, Saint Petersburg, Russia; lukyanovvd@rambler.ru

An algorithm for the approximation of relationship pluralities is set by linear combinations of functions with unknown coefficients, which in part coincides in all relationship pluralities having been built using ordinary least squares. Examples of the algorithm’s realization, when finding particular solutions plurality of linear nonhomogeneous differential equations, have been given.

Keywords: approximation, ordinary least squares, dependences plurality.

PACS 02.30.Mv

Download

Leave a Reply

Your email address will not be published.

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>