On Tensor-Train Ranks of Tensorized Polynomials

DOI10.1007/978-3-030-41032-2_21MaRDI QIDQ3297707zbMATH OpenOpenAlexFDO

Authors L. I. Vysotsky

Publication date 20 July 2020

Published in Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-41032-2_21

zbMATH Keywords

discretizationtensor train formattensorizationTT-decompositionTT-ranks

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Recommendations

• Polynomial foldings and rank of tensors
• Tensor rank: matching polynomials and Schur rings
• Symmetric tensor rank, cactus rank and related complexity measures for homogeneous polynomials
• Polynomial bound for the partition rank vs the analytic rank of tensors
• Lower bounds for polar and tensor ranks
• Tensor-train ranks for matrices and their inverses
• On Tensor Products of Polynomial Representations
• On the complexity of finding tensor ranks
• scientific article; zbMATH DE number 7387190
• Algebraic and computational aspects of real tensor ranks

Cites work

• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
• An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
• Approximation of 2d²^d matrices using tensor decomposition
• Constructive representation of functions in low-rank tensor formats
• Tensor approximations of matrices generated by asymptotically smooth functions
• Tensor-train decomposition

Cited in

(2)

• TT ranks of approximate tensorizations of some smooth functions
• Lower bounds for polar and tensor ranks

This page was built for publication: On Tensor-Train Ranks of Tensorized Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297707)