<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Modeling Geometric Varieties with Given Differential Characteristics and Its Application1</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Donbas National Academy of Civil Engineering and Architecture</institution>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sevastopol branch of «Plekhanov Russian University of Economics»</institution>
          ,
          <addr-line>Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article describes an approach to modeling geometric manifolds with specified differential properties, which is based on the use of geometric interpolants of a multidimensional space. A geometric interpolant is understood as a geometric object of a multidimensional space passing through predetermined points in advance, the coordinates of which correspond to the initial experimental and statistical information. Principles for determining geometric interpolants and an example of an analytical description of a 3-parameter geometric interpolant belonging to a 4-dimensional space in the form of a geometric scheme and a computational algorithm based on a sequence of point equations are given. The main direction of practical use of geometric interpolants is geometric modeling of multifactor processes and phenomena, but they can also be an effective tool for multivariate approximation. Based on this, the article presents a general approach to modeling geometric manifolds with given differential properties and its application in the form of a numerical solution of differential equations by approximating it using geometric interpolants of a multidimensional space. To implement an approach to modeling geometric manifolds with specified differential properties, it is proposed to use a computational algorithm consisting of 10 points. The advantages of using geometric interpolants for the numerical solution of differential equations are highlighted.</p>
      </abstract>
      <kwd-group>
        <kwd>Geometric Varieties</kwd>
        <kwd>Differential Characteristics</kwd>
        <kwd>Geometrical Interpolant</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Differential characteristics of geometric manifolds have important theoretical and
applied significance. The need to study them in parallel with the development of
mathematical analysis led to the emergence of differential geometry as a separate branch of
mathematics.</p>
      <p>
        In differential geometry, the geometric meaning of differentiation and integration
operations is considered. So, the geometric meaning of the first derivative of the
function is reduced to determining the tangent to the curve, and the second derivative – to
determining the curvature of the curve. The study of differential characteristics often
led to the creation of new geometric objects based on their prototypes. For example, an
evolute, that has found wide application in engineering practice, is a geometric place of
points (a curve) that are the centers of curvature of the original curve. Another example
of using differential characteristics of curved lines is the work [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ], in which the author
proposed the use of functional curves for geometric modeling of physical processes in
the form of a set of functionally interconnected lines of trajectory, speed and
acceleration. This approach is valid for defining other geometric manifolds: compartments of
surfaces, hypersurfaces, etc., which leads to differentiation of the function of many
variables. For example, the point equation of the torso surface as a geometric place of
tangents to its return edge is nothing more than a differential equation of a function of
two variables. If we consider the analytical description of geometric manifolds obtained
by differential-geometric transformations, then in their structure they are nothing more
than a certain differential equation and are its geometric equivalent. Then, between
differential equations and geometric manifolds with given differential characteristics,
there is a mutually inverse logical relationship. That is, geometrical manifolds with
given differential characteristics can serve as a particular solution of differential
equations in the same way as differential equations are used to analytically describe
geometric manifolds with given differential characteristics.
      </p>
      <p>
        Differential equations can have both exact and approximate (numerical) solutions.
In engineering practice, there are often differential equations whose solution cannot be
expressed in elementary mathematical functions. Therefore, numerical methods based
on multidimensional interpolation and approximation are used for their particular
solution. An example is the iso-geometric method for solving partial differential equations
[
        <xref ref-type="bibr" rid="ref4 ref5">4-5</xref>
        ], which is based on the concept that the same set of functions is used both for an
analytical description of an approximating geometric object and for approximating a
solution. In the works of Sophus Li [
        <xref ref-type="bibr" rid="ref6 ref7">6-7</xref>
        ], a detailed study of point groups of plane
transformations is proposed, whereas differential equations are found not as the main
object of research, but as an auxiliary apparatus. Another approach based on modeling
geometric manifolds with pre-defined properties is proposed in [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8-10</xref>
        ]. The main
concept of the proposed approach to the numerical solution of differential equations [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8-10</xref>
        ]
is to use geometric interpolants of a multidimensional space [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] to model geometric
manifolds with specified differential characteristics.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Principles for determining geometric interpolants in a multidimensional space</title>
      <p>
        In General, a geometric interpolant is a geometric object of a multidimensional affine
space that passes through pre-defined points whose coordinates correspond to the
original experimental and statistical information [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The process of determining
geometric interpolants consists of two principal stages: building a tree of a geometric model
      </p>
      <p>
        Modeling Geometric Varieties with Given Differential Characteristics and Its Application 3
and its analytical description using point equations [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and computational algorithms
based on them. The tree of a geometric model is a geometric scheme for the graphical
construction of a geometric interpolant based on the method of a moving simplex [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
using as formative elements algebraic curves passing through pre-defined points
obtained on the basis of Bernstein polynomials [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>1 the principle. From simple to complex. Any, even the most complex geometric
interpolant, is represented by a set of simpler geometric interpolants, united with each
other by a generating line. For example, a geometric interpolant of 2-dimensional space,
which is a section of the response surface, can be represented as a set of 1-dimensional
geometric interpolants (reference lines passing through pre-defined points), connected
to each other using a generating line. The more we set the current parameters that
determine the geometric interpolant, the more complicated will be the structure of the tree
of the geometric model and, accordingly, the computational algorithm for constructing
it. However, it still consists of simpler interconnected elements.</p>
      <p>
        2 the principle. Belonging of one geometric object to another. The geometric
theory of multidimensional interpolation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is based on the simplest principle of
belonging of one geometric object to another accepted in descriptive geometry, according to
which a straight line belongs to a plane if two points of this line belong to a plane. In
turn, a point belongs to a plane if it belongs to a straight line lying in that plane.
Considering a straight line as a special case of a curve, and a plane as a special case of a
surface, we obtain the statement, that is necessary for defining a 2-parameter geometric
interpolant in the form of a compartment of a surface, that passes through
predetermined points and belongs to 3-dimensional space.
      </p>
      <p>Statement 1. In order for the source points to belong to a 2-parameter geometric
interpolant, you must organize them as reference lines (in descriptive geometry, the
term guide lines is used), and then combine them using a generating line that passes
through the current points of the reference line family.</p>
      <p>Then all points, that belong to the reference lines will belong to the desired
2-parameter interpolant. It should be noted that the formative element of both the reference and
forming lines of the geometric interpolant are arcs of algebraic curves passing through
pre-set points. Only when forming reference lines, the curves pass through the source
points (whose coordinates correspond to the original experimental and statistical
information), and when forming the generating line-through the current points of reference
lines of the geometric interpolant.</p>
      <p>Generalizing the proposed approach to defining geometric interpolants on a
4-dimensional space, we obtain a statement akin to statement 1.</p>
      <p>Statement 2. In order for the source points to belong to a 3-parameter geometric
interpolant, you must organize the source points as 2-parameter geometric interpolants
(a family of reference surfaces), united in a hypersurface by a forming line passing
through the current points of the family of reference surfaces.</p>
      <p>Similarly, you can define an n-parametric geometric interpolant, that belongs to an
(n+1)-dimensional space.</p>
      <p>As an example, consider the tree of a geometric model of a 3-parameter geometric
interpolant (Fig. 1).
An analytical description of a 3-parametric geometric interpolant in the form of a
3parametric hypersurface is represented by the following sequence of point equations:

 =1


 =1
  = ∑</p>
      <p>( )
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  = ∑     ( )</p>
      <p>,</p>
      <p>i − current point of the generator i a section of the surface that passes
through pre-defined points, which is a reference for building a hypersurface;</p>
      <p>Mij − current point j the reference arc of a curve that passes through
preset points;</p>
      <p>Mijk − the starting points through which the desired hypersurface
compartment should pass. The coordinates of these points correspond to the original
experimental and statistical data;
pijk (u) − functions from the parameter that define the type of reference lines;
qij (v) − functions from the parameter v , defining the type of forming lines
compartments surfaces;</p>
      <p>ri (w) − functions from the parameter w , defining the form of the
hypersurface compartment forming line; l − number of source points in each reference
line;
n − the number of control lines to build the reference surfaces;
m − number of reference surfaces for building a hypersurface;
i − serial number of the reference surface;
Modeling Geometric Varieties with Given Differential Characteristics and Its Application 5
j − sequential number of the reference line;
k − the sequential number of the starting point in each reference line;
u , v and w − current parameters that change from 0 to 1.</p>
      <p>To move from point equations to parametric ones, you need to perform a coordinate
calculation, which is the analytical equivalent of projecting a 3-parameter hypersurface
on the axis of the global coordinate system.</p>
      <p>
        The main direction of practical use of the geometric theory of multidimensional
interpolation is geometric modeling of multi-factor processes and phenomena [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In
addition, it can be effectively used in geometric computer modeling as a forming tool
for modeling geometric shapes and bodies passing through pre-set points. However,
another effective application of the geometric theory of multidimensional interpolation
is possible. In particular, in [
        <xref ref-type="bibr" rid="ref10 ref15 ref16 ref8 ref9">8-10, 15-16</xref>
        ], 3 variants of using geometric interpolants for
multidimensional approximation are proposed and studied:
─ by selecting nodal points from the original set of points [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
─ by minimizing the sum of lengths between nodes and source points [
        <xref ref-type="bibr" rid="ref16 ref17">16-17</xref>
        ].
─ by setting the required differential characteristics at the nodal points [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8-10</xref>
        ].
      </p>
      <p>
        The second variant [
        <xref ref-type="bibr" rid="ref16 ref17">16-17</xref>
        ] is presented as a result of generalization of the least
squares method to a multidimensional space using its geometric interpretation. In
[810], an additional field of application of the third variant of multidimensional
approximation is proposed: numerical solution of differential equations using geometric
interpolants, which is based on the modeling of geometric manifolds with specified
differential characteristics.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>General approach to modeling geometric manifolds with specified differential characteristics</title>
      <p>The main idea of the proposed approach to modeling geometric manifolds with given
differential properties is as follows: in multidimensional nodes interpolation network
of points the condition of the original differential equation is satisfied, which provides
the required differential properties of the simulated geometric object. Multidimensional
interpolation is performed automatically between nodes in the point network by using
geometric interpolants. This is the numerical solution of the original differential
equation.</p>
      <p>
        To implement an approach to modeling geometric manifolds with specified
differential characteristics, we suggest using the following algorithm:
1. We should to form a network of points of the necessary dimension and density
depending on original differential equation. We recommend using a regular point
network, but if necessary, you can also use an irregular point network.
2. Structure the generated network of points to build a tree of the geometric model.
3. Use formative arcs of algebraic curves passing through the front set points, for the
analytical description of the geometric interpolant. In this case, we form a
computational algorithm equivalent to the tree of the geometric model.
4. Perform a coordinate calculation and, if using a regular network of points, go from
the system of parametric equations for the analytical description of the geometric
interpolant to its explicit equation. If an irregular network of points is used,
additional differentiation of parametric equations by parameters is necessary, followed
by solving a homogeneous system of first-degree differential equations by the
Kramer method [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
5. Enter the coordinates of the points corresponding to the initial and boundary
conditions of the original differential equation. Geometric representation of initial and
boundary conditions can be geometric objects: points, lines, surfaces, etc., that pass
through pre-defined points.
6. Differentiate the resulting equations and substitute them into the original
differential equation. Thus, we obtain an equation of an approximating geometric
interpolant with pre-defined differential characteristics.
7. Substitute parameter values at the nodal points, thereby forming local system of
linear algebraic equations (SLAE).
8. In the case of using piecewise polynomial approximation, repeat the first 7 points
of the computational algorithm several times. With this, we accumulate local
SLAEs to form a global SLAE. In the case of using a continuous geometric
interpolant, this point of the algorithm must be ignored and go to the next.
9. Solve the resulting SLAE and determine the necessary parameter values at the nodal
points of the geometric interpolant. Then insert the calculation result into the
equation of the approximating geometric interpolant from the 6th point.
10. Analyze the result and check its validity. If the results are not accurate enough,
increase the number of nodal points in the geometric interpolant.
      </p>
      <p>It should be noted that the order of the initial differential equation is directly related
to the order of the shape-forming curves passing through the predetermined points of
the geometric interpolant. Moreover, to ensure the correct result, it is necessary that
the order of the forming curves passing through the predetermined points is higher than
the order of the original differential equation.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Practical application of the proposed approach</title>
      <p>The main practical application of the proposed approach to modeling geometric
manifolds with specified differential characteristics is the numerical solution of differential
equations in computer-aided design and calculation systems by approximating their
solutions using geometric interpolants of a multidimensional space. At the same time, it
should be noted that the proposed approach is sufficiently universal and that it is
possible to increase both the number of variables of the original differential equation and
its order. Moreover, if the solution can be represented with sufficient accuracy as a
smooth function, it is preferable to use continuous geometric interpolants. In other
cases, it is possible to use piecewise polynomial functions in the form of
multidimensional contours using algebraic curves of different smoothness order.</p>
      <p>The proposed approach can be effectively used primarily for the numerical solution
of partial differential equations for which the solution is not expressed in elementary</p>
      <p>
        Modeling Geometric Varieties with Given Differential Characteristics and Its Application 7
functions. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], an example of a numerical solution of an inhomogeneous heat
equation using a 16-point geometric interpolant is given, and the results of the numerical
solution are compared with the reference solution obtained by the method of separating
variables. At the same time, further use of the resulting numerical solution in the form
of a polynomial dependence is more preferable for engineering calculations, in
comparison with the equation obtained by the method of dividing variables.
      </p>
      <p>It should be noted, that by covering a multidimensional network of source points
with a single geometric interpolant, a finite super element for approximating
differential equations is formed, which has the following advantages:
1. Curved geometric objects of a multidimensional affine space are simultaneous
carriers of several points, which significantly reduces the "piecewise" of the final
function and the number of necessary calculations.
2. With regard to solving problems of strength and stability, the final super element can
be used on any network of points, while maintaining a curved component, which
ensures that geometric nonlinearity is taken into account when solving problems of
strength and stability. At the same time, the possibility of geometric modeling of
physical, structural, genetic and other non-linearity remains.
3. Due to the invariant properties of the parameter of point equations, there is no need
to use guide cosines.
4. Using the geometric theory of multidimensional interpolation, it is possible to
generalize the approach to modeling geometric manifolds with given differential
characteristics both in the direction of increasing the number of variables and in the
direction of increasing the order of derivatives of the original differential equation.
Moreover, the number of variables is limited only by the dimension of the space, and
the order of derivatives is limited by the order of forming curves of the geometric
interpolant.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In conclusion, we would like to note the need for further research and development of
the proposed approach to modeling geometric manifolds with specified differential
characteristics, which can take its place in the number of innovative numerical methods
for solving differential equations. The prospect of further research is to conduct further
computational experiments to test the accuracy and speed of the proposed approach to
modeling geometric manifolds with specified differential characteristics and its
practical application to the numerical solution of partial differential equations. It is assumed,
that the use of a geometric interpolant as an analog of a finite super element, will allow
us to obtain a numerical solution of partial differential equations and their systems of
the required accuracy in the shortest possible time, even taking into account the
nonlinear formulation of the original modeling problem.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Vereshaga</surname>
            <given-names>V. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bezditnyi</surname>
            <given-names>A. A.</given-names>
          </string-name>
          :
          <article-title>Modeling of functional curves of speed and distance in bn calculus</article-title>
          .
          <source>Bulletin of Kherson national technical University</source>
          .
          <volume>3</volume>
          (
          <issue>50</issue>
          ),
          <fpage>562</fpage>
          -
          <lpage>566</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bezditnyi</surname>
            <given-names>A. A.</given-names>
          </string-name>
          :
          <article-title>Functional distance curve by means of BN-calculus</article-title>
          .
          <source>Applied geometry and engineering graphics</source>
          .
          <volume>4</volume>
          (
          <issue>48</issue>
          ),
          <fpage>158</fpage>
          -
          <lpage>161</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Naidysh</surname>
            <given-names>A. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baluba</surname>
            <given-names>I. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bezditnyi</surname>
            <given-names>A. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davydenko</surname>
            <given-names>I. P.</given-names>
          </string-name>
          :
          <article-title>Functional speed curve by means of BN-calculus / Applied geometry</article-title>
          and engineering graphics.
          <volume>4</volume>
          (
          <issue>56</issue>
          ),
          <fpage>10</fpage>
          -
          <lpage>16</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cottrell</surname>
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hughes</surname>
            <given-names>T.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bazilevs</surname>
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Isogeometric Analysis: Toward Integration of CAD and FEA</article-title>
          . John Wiley &amp; Sons, Ltd.
          <source>Chichester</source>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Vuong</surname>
            <given-names>A</given-names>
          </string-name>
          .-V.:
          <article-title>Adaptive Hierarchical Isogeometric Finite Element Methods</article-title>
          . Springer Spektrum. Wiesbaden. (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Zaitsev</surname>
            <given-names>V. F.</given-names>
          </string-name>
          :
          <article-title>Symmetries of differential equations. Formal operators</article-title>
          . https://cyberleninka.ru/article/n/symmetrii
          <article-title>-differentsialnyh-uravneniy-formalnye-operational</article-title>
          ,
          <source>last accessed</source>
          <year>2019</year>
          /03/08.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Yakovenko</surname>
            <given-names>G. N.</given-names>
          </string-name>
          :
          <article-title>Differential equations with fundamental solutions: Sophus Li and others</article-title>
          .
          <source>Fizmatkniga</source>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Solving differential equations by geometric modeling methods</article-title>
          .
          <source>Proceedings of the 28th International conference on computer graphics and machine vision "GraphiCon</source>
          <year>2018</year>
          ". Tomsk, pp.
          <fpage>322</fpage>
          -
          <lpage>325</lpage>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Modeling of an approximating 16-point compartment of the response surface, applied to the solution of a non-uniform heat equation</article-title>
          .
          <source>Geometry and graphics. 7</source>
          (
          <issue>2</issue>
          ),
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shevchuk</surname>
            <given-names>O. A.</given-names>
          </string-name>
          :
          <article-title>Use of geometric interpolants for numerical solution of differential equations. Information technologies: materials of the 84th scientific and technical conference of faculty, research staff and postgraduates (with international participation)</article-title>
          . Minsk, pp.
          <fpage>194</fpage>
          -
          <lpage>196</lpage>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Geometric theory of multivariate interpolation. Automation and simulation in engineering and management</article-title>
          .
          <source>Bryansk</source>
          ,
          <volume>1</volume>
          (
          <issue>07</issue>
          ),
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Balyuba</surname>
            <given-names>I. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bumaga</surname>
            <given-names>A. I.</given-names>
          </string-name>
          :
          <article-title>Point calculus: educational and methodological guide</article-title>
          .
          <source>Makeyevka</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Modeling of arcs of curves passing through pre-set points. Bulletin of computer and information technologies</article-title>
          .
          <source>No. 2</source>
          , pp.
          <fpage>30</fpage>
          -
          <lpage>36</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bezditnyi</surname>
            <given-names>A.A.</given-names>
          </string-name>
          :
          <article-title>Geometric modeling of multifactor processes and phenomena by the multidimensional parabolic interpolation method</article-title>
          .
          <source>IoP conference series: Journal of Physics: Conf. Series 1441</source>
          <volume>012063</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Approximation of geometric objects using arcs of curves passing through pre-set points</article-title>
          .
          <source>Information technologies</source>
          .
          <volume>1</volume>
          (
          <issue>25</issue>
          ),
          <fpage>46</fpage>
          -
          <lpage>52</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          :
          <article-title>Geometric meaning of the method of least squares. Bulletin of computer and information technologies</article-title>
          .
          <source>No. 9</source>
          ,
          <fpage>11</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Konopatskiy</surname>
            <given-names>E. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotkov</surname>
            <given-names>S. I.</given-names>
          </string-name>
          :
          <article-title>Approximation of geometric objects of multidimensional space using arcs of curves passing through pre-set points</article-title>
          .
          <source>Proceedings of the 29th International conference on computer graphics and machine vision "GraphiCon</source>
          <year>2019</year>
          ". Bryansk, pp.
          <fpage>191</fpage>
          -
          <lpage>195</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Fichtenholz G. M.</surname>
          </string-name>
          <article-title>: Course of differential and integral calculus</article-title>
          .
          <source>Book on Demand</source>
          , Moscow, No.
          <volume>1</volume>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>