<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">london-journal-of-research-in-science-natural-and-formal</journal-id>
<journal-title-group>
<journal-title>London Journal of Research In Science: Natural and Formal</journal-title>
</journal-title-group>
<issn publication-format="print">2631-8490</issn>
<issn publication-format="electronic">2631-8504</issn>
<publisher><publisher-name>JournalsPress</publisher-name></publisher>
<self-uri xlink:href="https://journalspress.com/journal-seo-export/jats/226874.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.34257/LJRS226874UK</article-id>
<article-id pub-id-type="publisher-id">226874</article-id>
<title-group>
<article-title>Statistical Data Approximations by a New Method and Its Engineering Applications</article-title>
<subtitle>New Linear Approximation by Distance Minimization</subtitle>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Oshkhunov</surname><given-names>Muaed M.</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Tlibekov</surname><given-names>Aleksey Kh.</given-names></name><xref ref-type="aff" rid="aff2" />
</contrib>
<contrib contrib-type="author"><name><surname>Dosko</surname><given-names>Sergey I.</given-names></name></contrib>
</contrib-group>
<aff id="aff1">Russia, Kabardino - Balkarian State University</aff>
<aff id="aff2">Russia</aff>
<volume>26</volume>
<issue>9</issue>
<abstract><p>A new method of approximation by linear functions of random points specified in the Cartesian coordinate system is proposed and tested. The coefficients of the equation are determined from the condition of the minimum sum of the squares of the distances to the given points. In contrast to the classical method of approximation by linear functions, the proposed method does not lead to the uniqueness of the solution. A brief summary of the theory of the new method and its application is given. In particular, the following problems are considered: approximation of a random numerical field; interpolation of experimental data; analysis of the variance of the results of experiments; optimal placement of machine-building equipment; forecast of the number of products. The results of the calculations showed the high efficiency of the proposed method for solving practical problems.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>least squares method</kwd>
<kwd>linear regression</kwd>
<kwd>distance minimization</kwd>
<kwd>piecewise linear</kwd>
<kwd>variance analysis</kwd>
<kwd>optimal placement</kwd>
<kwd>predictive analytics.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://doc.journalspress.com/zqbv70_226874/article/new-linear-approximation-by-distance-minimization.pdf?v=95fd2dd331ec" />
<self-uri content-type="html" xlink:href="https://journalspress.com/statistical-data-approximations-by-a-new-method-and-its-engineering-applications/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>A new method of approximation by linear functions of random points specified in the Cartesian coordinate system is proposed and tested. The coefficients of the equation are determined from the condition of the minimum sum of the squares of the distances to the given points.
In contrast to the classical method of approximation by linear functions, the proposed method does not lead to the uniqueness of the solution.
A brief summary of the theory of the new method and its application is given.  In particular, the following problems are considered: approximation of a random numerical field;  interpolation of experimental data; analysis of the variance of the results of experiments; optimal placement of machine-building equipment; forecast of the number of products. The results of the calculations showed the high efficiency of the proposed method for solving practical problems.</p>
</sec>
</body>
</article>