Počet záznamů: 1  

Extension of the semi-algebraic framework for approximate CP decompositions via non-symmetric simultaneous matrix diagonalization

  1. 1.
    0468393 - ÚTIA 2017 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
    Naskovska, K. - Haardt, M. - Tichavský, Petr - Chabriel, G. - Barrere, J.
    Extension of the semi-algebraic framework for approximate CP decompositions via non-symmetric simultaneous matrix diagonalization.
    Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Proocessing. Piscataway: IEEE, 2016, s. 2971-2975. ISBN 978-1-4799-9987-3.
    [IEEE International Conference on Acoustics, Speech, and Signal Processing 2016 (ICASSP2016). Shanghai (CN), 20.03.2016-25.03.2016]
    Grant CEP: GA ČR(CZ) GA14-13713S
    Institucionální podpora: RVO:67985556
    Klíčová slova: CP decomposition * semi-algebraic framework * non-symmetric simultaneous matrix diagonalization
    Kód oboru RIV: BB - Aplikovaná statistika, operační výzkum
    http://library.utia.cas.cz/separaty/2016/SI/tichavsky-0468393.pdf

    With the increased importance of the CP decomposition (CANDECOMP / PARAFAC decomposition), efficient methods for its calculation are necessary. In this paper we present an extension of the SECSI (SEmi-algebraic framework for approximate CP decomposition via SImultaneous matrix diagonalization) that is based on new non-symmetric SMDs (Simultaneous Matrix Diagonalizations).
    Moreover, two different algorithms to calculate non-symmetric SMDs are presented as examples, the TEDIA (TEnsor DIAgonalization) algorithm and the IDIEM-NS (Improved DIagonalization
    using Equivalent Matrices-Non Symmetric) algorithm. The SECSI-TEDIA framework has an increased computational complexity but often achieves a better performance than the original SECSI framework. On the other hand, the SECSI-IDIEM framework offers a lower computational complexity while sacrificing some performance accuracy.
    Trvalý link: http://hdl.handle.net/11104/0269443

     
     
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.