• DocumentCode
    165024
  • Title

    Parallel digraphs-building algorithm for polynomial realisations

  • Author

    Hryniow, Krzysztof ; Markowski, Konrad Andrzej

  • Author_Institution
    Electr. Dept., Warsaw Univ. of Technol., Warsaw, Poland
  • fYear
    2014
  • fDate
    28-30 May 2014
  • Firstpage
    174
  • Lastpage
    179
  • Abstract
    In this paper, the new method of the determination of entries of the state matrices of the positive two-dimensional systems described by the second Fornasini-Marchesini model (IIF-M) using digraphs theory D(2) has been presented. For the proposed method parallel computing algorithm was constructed. Algorithm is based on GPGPU (General- Purpose Computing on Graphics Processing Units) computing method to gain needed speed and computational power for such solution. The proposed method was discussed and illustrated with numerical examples. Proposed solution allows digraphs construction for any positive two-dimensional system, regardless of its complexity.
  • Keywords
    directed graphs; graphics processing units; mathematics computing; matrix algebra; parallel algorithms; polynomials; Fornasini-Marchesini model; GPGPU; digraphs theory; general-purpose computing on graphics processing unit; parallel computing algorithm; parallel digraphs-building algorithm; polynomial realisations; positive two-dimensional system; state matrices; Graphics processing units; Indexes; Kernel; Mathematical model; Polynomials; Transfer functions; Vectors; 2D systems; GPGPU; algorithm; digraphs; polynomial; realisation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Conference (ICCC), 2014 15th International Carpathian
  • Conference_Location
    Velke Karlovice
  • Print_ISBN
    978-1-4799-3527-7
  • Type

    conf

  • DOI
    10.1109/CarpathianCC.2014.6843592
  • Filename
    6843592