Pencil-Based Algorithms For Tensor Rank Decomposition Are Not Stable
We prove the existence of an open set of n1 ×n2 ×n3 tensors of rank r for which popular and e?cient algorithms for computing tensor rank decompositions based on a reduction to a linear matrix pencil, typically followed by a generalized eigendecomposition, are arbitrarily numerically forward unstable...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Cantabria (UC) |
| Repositorio: | UCrea Repositorio Abierto de la Universidad de Cantabria |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unican.es:10902/18159 |
| Acceso en línea: | http://hdl.handle.net/10902/18159 |
| Access Level: | acceso abierto |
| Palabra clave: | Jennrich’s algorithm Canonical polyadic decomposition Tensor rank decomposition Numerical instability CPD |
| Sumario: | We prove the existence of an open set of n1 ×n2 ×n3 tensors of rank r for which popular and e?cient algorithms for computing tensor rank decompositions based on a reduction to a linear matrix pencil, typically followed by a generalized eigendecomposition, are arbitrarily numerically forward unstable. Our analysis shows that this problem is caused by the fact that the condition number of tensor rank decomposition can be much larger for n1 ×n2 ×2 tensors than for the n1 ×n2 ×n3 input tensor. Moreover, we present a lower bound for the limiting distribution of the condition number of random tensor rank decompositions of third-order tensors. The numerical experiments illustrate that for random tensor rank decompositions one should anticipate a loss of precision of a few digits. |
|---|