<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0474387</ARLID> <utime>20240103214032.4</utime><mtime>20170505235959.9</mtime>   <SCOPUS>85017217771</SCOPUS> <WOS>000401043400032</WOS>  <DOI>10.1016/j.sigpro.2017.04.001</DOI>           <title language="eng" primary="1">Non-orthogonal tensor diagonalization</title>  <specification> <page_count>8 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0255076</ARLID><ISSN>0165-1684</ISSN><title>Signal Processing</title><part_num/><part_title/><volume_id>138</volume_id><volume>1 (2017)</volume><page_num>313-320</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>multilinear models</keyword>   <keyword>canonical polyadic decomposition</keyword>   <keyword>parallel factor analysis</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101212</ARLID> <name1>Tichavský</name1> <name2>Petr</name2> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept language="eng">Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department language="eng">SI</department> <institution>UTIA-B</institution> <full_dept>Department of Stochastic Informatics</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0274170</ARLID> <name1>Phan</name1> <name2>A. H.</name2> <country>JP</country> </author> <author primary="0"> <ARLID>cav_un_auth*0274171</ARLID> <name1>Cichocki</name1> <name2>A.</name2> <country>JP</country> </author>   <source> <url>http://library.utia.cas.cz/separaty/2017/SI/tichavsky-0474387.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0303443</ARLID> <project_id>GA14-13713S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project> <project> <ARLID>cav_un_auth*0345929</ARLID> <project_id>GA17-00902S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It has a link to an approximate joint diagonalization (AJD) of a set of matrices. In this paper, we derive (1) a new algorithm for a symmetric AJD, which is called two-sided symmetric diagonalization of an order-three tensor, (2) a similar algorithm for a non-symmetric AJD, also called a two-sided diagonalization of an order-three tensor, and (3) an algorithm for three-sided diagonalization of order-three or order-four tensors. The latter two algorithms may serve for canonical polyadic (CP) tensor decomposition, and in certain scenarios they can outperform traditional CP decomposition methods. Finally, we propose (4) similar algorithms for tensor block diagonalization, which is related to tensor block-term decomposition. The proposed algorithm can either outperform the existing block-term decomposition algorithms, or produce good initial points for their application.</abstract>     <RIV>BB</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10103</FORD2>    <reportyear>2018</reportyear>      <num_of_auth>3</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0271454</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 2 Article Engineering Electrical Electronic  </unknown> <unknown tag="mrcbC86"> 2 Article Engineering Electrical Electronic  </unknown> <unknown tag="mrcbC86"> 2 Article Engineering Electrical Electronic  </unknown>         <unknown tag="mrcbT16-e">ENGINEERING.ELECTRICAL&amp;ELECTRONIC</unknown> <unknown tag="mrcbT16-f">3.180</unknown> <unknown tag="mrcbT16-g">1.157</unknown> <unknown tag="mrcbT16-h">5.9</unknown> <unknown tag="mrcbT16-i">0.01942</unknown> <unknown tag="mrcbT16-j">0.817</unknown> <unknown tag="mrcbT16-k">11626</unknown> <unknown tag="mrcbT16-s">0.940</unknown> <unknown tag="mrcbT16-5">2.973</unknown> <unknown tag="mrcbT16-6">356</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">63.612</unknown> <unknown tag="mrcbT16-C">80.6</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <unknown tag="mrcbT16-M">1.27</unknown> <unknown tag="mrcbT16-N">Q1</unknown> <unknown tag="mrcbT16-P">80.577</unknown> <arlyear>2017</arlyear>       <unknown tag="mrcbU14"> 85017217771 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000401043400032 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0255076 Signal Processing 0165-1684 1872-7557 Roč. 138 č. 1 2017 313 320 Elsevier </unknown> </cas_special> </bibitem>