Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Ignat Domanov"'
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 42:913-953
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2efe6bedf9db08c8826a350d3f866196
https://doi.org/10.1137/17m1150062
https://doi.org/10.1137/17m1150062
Autor:
Lieven De Lathauwer, Ignat Domanov
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual decompositions. In gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57f815cacfcf78e730d51a59f7bdcc16
https://lirias.kuleuven.be/handle/123456789/673371
https://lirias.kuleuven.be/handle/123456789/673371
Publikováno v:
IEEE Transactions on Signal Processing. 66:3665-3680
IEEE The Canonical Polyadic Decomposition (CPD) plays an important role for signal separation in array processing. The CPD model requires arrays composed of several displaced but identical subarrays. Consequently, it is less appropriate for more comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f52b875ec934aeba7bb45bc26595f3c
https://doi.org/10.1109/tsp.2018.2835423
https://doi.org/10.1109/tsp.2018.2835423
Autor:
Lieven De Lathauwer, Ignat Domanov
Publikováno v:
Linear Algebra and its Applications. 513:342-375
© 2016 Elsevier Inc. Canonical Polyadic Decomposition (CPD) of a third-order tensor is a minimal decomposition into a sum of rank-1 tensors. We find new mild deterministic conditions for the uniqueness of individual rank-1 tensors in CPD and present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88e658b5020626512dc997e403e29261
https://doi.org/10.1016/j.laa.2016.10.019
https://doi.org/10.1016/j.laa.2016.10.019
Autor:
Lieven De Lathauwer, Ignat Domanov
Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine learning, etc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::848927e8369e0c3100b3e3015dd084a3
http://arxiv.org/abs/1808.02423
http://arxiv.org/abs/1808.02423
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 36:496-522
Copyright © by SIAM. Coupled tensor decompositions are becoming increasingly important in signal processing and data analysis. However, the uniqueness properties of coupled tensor decompositions have not yet been studied. In this paper, we first pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8521d6cf2b1827bca13c14785ca9ca76
https://doi.org/10.1137/140956853
https://doi.org/10.1137/140956853
Publikováno v:
Numerical Linear Algebra with Applications. 25:e2190
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae56d212f31b39a1a9be3de34c1d8745
https://doi.org/10.1002/nla.2190
https://doi.org/10.1002/nla.2190
Autor:
Ignat Domanov, Lieven De Lathauwer
Algebraic geometry, although little explored in signal processing, provides tools that are very convenient for investigating generic properties in a wide range of applications. Generic properties are properties that hold "almost everywhere". We prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd767a13437b13dfe3d2c41debecb737
http://arxiv.org/abs/1601.01173
http://arxiv.org/abs/1601.01173
Let $\sigma_n$ denote the largest mode-$n$ multilinear singular value of an $I_1\times\dots \times I_N$ tensor $\mathcal T$. We prove that $$ \sigma_1^2+\dots+\sigma_{n-1}^2+\sigma_{n+1}^2+\dots+\sigma_{N}^2\leq (N-2)\|\mathcal T\|^2 + \sigma_n^2,\qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3dd54a1395c4c011b308abfb03ade29
© 2015, Springer Science+Business Media New York. Line and plane searches are used as accelerators and globalization strategies in many optimization algorithms. We introduce a class of optimization problems called tensor optimization, which comprise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99a883f1bdae9de0205ca42a2b9fb456
https://lirias.kuleuven.be/handle/123456789/463246
https://lirias.kuleuven.be/handle/123456789/463246