SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains (Q5065504): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TKPSVD / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Numerical Analysis in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Tensor-Train Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On best rank one approximation of tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of singular vector tuples and uniqueness of best rank-one approximation of tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A literature survey of low-rank tensor approximation techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Spaces and Numerical Tensor Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank Tucker-type tensor approximation to classical potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor numerical methods in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resonant Damping of Flexible Structures Under Random Excitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LATIN multiscale computational method and the proper generalized decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor-Train Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Least Squares as Moving Subspace Correction / 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: On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On accelerating the regularized alternating least-squares algorithm for tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-One Approximation to High Order Tensors / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/20m1381472 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3170050064 / rank
 
Normal rank

Latest revision as of 10:55, 30 July 2024

scientific article; zbMATH DE number 7495538
Language Label Description Also known as
English
SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains
scientific article; zbMATH DE number 7495538

    Statements

    SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    tensor methods
    0 references
    canonical polyadic
    0 references
    tensor train
    0 references

    Identifiers