Numerical CP decomposition of some difficult tensors (Q508007): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cam.2016.12.007 / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A69 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6682810 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
small matrix multiplication | |||
Property / zbMATH Keywords: small matrix multiplication / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
canonical polyadic tensor decomposition | |||
Property / zbMATH Keywords: canonical polyadic tensor decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Levenberg-Marquardt method | |||
Property / zbMATH Keywords: Levenberg-Marquardt method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical result | |||
Property / zbMATH Keywords: numerical result / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: fminsearch / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963931908 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1603.01372 / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2016.12.007 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:52, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical CP decomposition of some difficult tensors |
scientific article |
Statements
Numerical CP decomposition of some difficult tensors (English)
0 references
9 February 2017
0 references
small matrix multiplication
0 references
canonical polyadic tensor decomposition
0 references
Levenberg-Marquardt method
0 references
numerical result
0 references
algorithm
0 references