Recompression of Hadamard products of tensors in Tucker format (CROSBI ID 416176)
Ocjenski rad | doktorska disertacija
Podaci o odgovornosti
Periša, Lana
Slapničar, Ivan ; Kressner, Daniel
engleski
Recompression of Hadamard products of tensors in Tucker format
In the last decade low-rank tensors decompositions have been established as a new tool in scientific computing to address large-scale linear and multilinear algebra problems, which would be intractable by classical techniques. Since tensors can be given only as the solution of some algebraic equation, it is important to develop solvers working within the compressed storage scheme. That is what this thesis is concerned with, focusing on Tucker format, one of the most commonly used low-rank representation of tensors, and Hadamard product, which features prominently in tensor-based algorithms in scientific computing and data analysis. Fast algorithms are attained by combining iterative methods, such as Lanczos method and randomized algorithms, with fast matrix-vector products that exploit the structure of Hadamard products. Algorithms are implemented in programming language Julia and a new Julia library for tensors in Tucker format is presented.
Tensors, Tucker format, Tucker decomposition, higher-order singular value decomposition (HOSVD), Hadamard products, low-rank approximation
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
111
23.11.2017.
obranjeno
Podaci o ustanovi koja je dodijelila akademski stupanj
Prirodoslovno-matematički fakultet, Zagreb
Zagreb