<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606204903</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101004.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/s00034-014-9842-1</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00034-014-9842-1</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Hajarian</subfield>
   <subfield code="D">Masoud</subfield>
   <subfield code="u">Department of Mathematics, Faculty of Mathematical Sciences, Shahid Beheshti University, General Campus, Evin, 19839, Tehran, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A Finite Iterative Method for Solving the General Coupled Discrete-Time Periodic Matrix Equations</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Masoud Hajarian]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Analysis and design of linear periodic control systems are closely related to the discrete-time periodic matrix equations. In this paper, we propose an iterative algorithm based on the conjugate gradient method on the normal equations (CGNE) for finding the solution group of the general coupled periodic matrix equations $$\begin{aligned} \left\{ \begin{array}{l} A_{1,i}X_iB_{1,i}+C_{1,i}X_{i+1}D_{1,i}=E_{1,i},\\ A_{2,i}X_iB_{2,i}+C_{2,i}X_{i+1}D_{2,i}=E_{2,i}, \end{array} \right. ~~~\mathrm {for}~~~i=1,2,3,\ldots . \end{aligned}$$ A 1 , i X i B 1 , i + C 1 , i X i + 1 D 1 , i = E 1 , i , A 2 , i X i B 2 , i + C 2 , i X i + 1 D 2 , i = E 2 , i , for i = 1 , 2 , 3 , ... . By proving some properties of the algorithm, we show that the solution group of the periodic matrix equations can be obtained within a finite number of iterations in the absence of roundoff errors. Numerical examples are given to illustrate the efficiency and accuracy of the proposed algorithm.</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">Discrete-time periodic matrix equation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Iterative algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Conjugate gradient method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Circuits, Systems, and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">34/1(2015-01-01), 105-125</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:1&lt;105</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">34</subfield>
   <subfield code="o">34</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00034-014-9842-1</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/s00034-014-9842-1</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">Hajarian</subfield>
   <subfield code="D">Masoud</subfield>
   <subfield code="u">Department of Mathematics, Faculty of Mathematical Sciences, Shahid Beheshti University, General Campus, Evin, 19839, Tehran, Iran</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">Circuits, Systems, and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">34/1(2015-01-01), 105-125</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:1&lt;105</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">34</subfield>
   <subfield code="o">34</subfield>
  </datafield>
 </record>
</collection>
