Pages that link to "Item:Q5232115"

The following pages link to Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable (Q5232115):

Displaying 9 items.

• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• Smoothed analysis for tensor methods in unsupervised learning (Q2144543) (← links)
• The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
• From Computation to Comparison of Tensor Decompositions (Q4986824) (← links)
• Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition (Q4997839) (← links)
• On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms (Q5113366) (← links)
• A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition (Q5862810) (← links)
• Nonlinear algebra and applications (Q6135318) (← links)
• On Best Low Rank Approximation of Positive Definite Tensors (Q6166055) (← links)