• DocumentCode
    2770626
  • Title

    A Fast Algorithm for Evaluating the m-th Power of Level Circulant Matrices of Type

  • Author

    Zhao, Guangyuan

  • Author_Institution
    Coll. of Comput. Sci. & Technol., Shandong Univ. of Technol., Zibo, China
  • Volume
    2
  • fYear
    2009
  • fDate
    13-15 Nov. 2009
  • Firstpage
    576
  • Lastpage
    579
  • Abstract
    It is well known that the circulant matrices are very important and special matrix. In recent years, various type of circulant matrices have been applied in such as signal dealing and oil exploration, and so on. In this paper, motivated by [Shen Guangxing (2004)], we give a fast algorithm for evaluating the m-th power of level-k(r1, r2, ···, rk)-circulant matrices of type (n1, n2, ···, nk). By [Shen Guangxing (2004)], and [Lu Chengbo (2004)], we can see the complexity of computation can reduce n times.
  • Keywords
    computational complexity; matrix algebra; computation complexity; level circulant matrices; oil exploration; signal dealing; Computer science; Educational institutions; Eigenvalues and eigenfunctions; Petroleum; Sun;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Technology and Development, 2009. ICCTD '09. International Conference on
  • Conference_Location
    Kota Kinabalu
  • Print_ISBN
    978-0-7695-3892-1
  • Type

    conf

  • DOI
    10.1109/ICCTD.2009.220
  • Filename
    5360214
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2770626