Pages that link to "Item:Q4604567"
From MaRDI portal
The following pages link to The Condition Number of Join Decompositions (Q4604567):
Displaying 17 items.
- On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition (Q1630059) (← links)
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number (Q1693629) (← links)
- Riemannian Newton optimization methods for the symmetric tensor approximation problem (Q2070849) (← links)
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions (Q2135086) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Perturbation analysis for matrix joint block diagonalization (Q2273874) (← links)
- An approximation method of CP rank for third-order tensor completion (Q2662903) (← links)
- Three decompositions of symmetric tensors have similar condition numbers (Q2689155) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable (Q5232115) (← links)
- The Dynamics of Swamps in the Canonical Tensor Approximation Problem (Q5238232) (← links)
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (Q5376452) (← links)
- The Condition Number of Riemannian Approximation Problems (Q5857299) (← links)
- A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition (Q5862810) (← links)
- The condition number of many tensor decompositions is invariant under Tucker compression (Q6047573) (← links)
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition (Q6087747) (← links)