Numerical CP decomposition of some difficult tensors (Q508007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization techniques for small matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Line Search: A Novel Method to Accelerate PARAFAC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms / rank
 
Normal rank

Revision as of 09:39, 13 July 2024

scientific article
Language Label Description Also known as
English
Numerical CP decomposition of some difficult tensors
scientific article

    Statements

    Identifiers