<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606217037</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101106.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10598-014-9259-5</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10598-014-9259-5</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Vinnikov</subfield>
   <subfield code="D">E.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Construction of Attainable Sets and Integral Funnels of Nonlinear Controlled Systems in the Matlab Environment</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[E. Vinnikov]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Attainable sets play an important role in investigating the behavior of controlled systems. The pixel method [1,2] is a universal numerical method for the construction of attainable sets of nonlinear controlled system. In the first part of the article, we describe the pixel method that requires partition of the phase space into n-dimensional cubes and time discretization using Euler and Runge-Kutta methods of second order approximation. This method enables us to construct attainability and controllability sets as well as integral funnels for nonlinear controlled systems described by a system of differential equations with controlled parameters, both with and without phase constraints. For attainable sets constructed by the pixel method, we have obtained bounds on the Hausdorff distance between the exact attainable set and its discrete approximation. These bounds lead to a relationship between the partition parameters in time and phase coordinates. In the second part of the article, we present a description of the program PixelSet developed in the Matlab environment for the construction of attainable sets and integral funnels of two- and three-dimensional nonlinear controlled systems by the pixel method. We present examples of the construction of attainable sets of some two- and three-dimensional controlled systems.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">nonlinear control systems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">phase constraints</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">attainable set</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Computational Mathematics and Modeling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/1(2015-01-01), 107-119</subfield>
   <subfield code="x">1046-283X</subfield>
   <subfield code="q">26:1&lt;107</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">10598</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10598-014-9259-5</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10598-014-9259-5</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Vinnikov</subfield>
   <subfield code="D">E.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Computational Mathematics and Modeling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/1(2015-01-01), 107-119</subfield>
   <subfield code="x">1046-283X</subfield>
   <subfield code="q">26:1&lt;107</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">10598</subfield>
  </datafield>
 </record>
</collection>
