TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization (Q6172876)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization

scientific article; zbMATH DE number 7714792

Language	Label	Description	Also known as
default for all languages	No label defined
English	TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization	scientific article; zbMATH DE number 7714792

Statements

instance of

scholarly article

0 references

title

TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization (English)

0 references

0 references

0 references

0 references

0 references

0 references

Computational and Applied Mathematics

0 references

publication date

20 July 2023

0 references

zbMATH Keywords

tensor ring decomposition

0 references

tensor train decomposition

0 references

scaled tri-factorization

0 references

fast algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s40314-023-02368-w

0 references

cites work

Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations

0 references

Symmetric tensor decomposition

0 references

Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications

0 references

An efficient randomized algorithm for computing the approximate Tucker decomposition

0 references

Hyperspectral Image Compressive Sensing Reconstruction Using Subspace-Based Nonlocal Tensor Ring Decomposition

0 references

Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions

0 references

A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization

0 references

On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

Rank-adaptive tensor methods for high-dimensional nonlinear PDEs

0 references

Low-rank tensor completion using matrix factorization based on tensor train rank and total variation

0 references

Tensor train rank minimization with nonlocal self-similarity for tensor completion

0 references

Hierarchical orthogonal factorization: sparse least squares problems

0 references

Most tensor problems are NP-hard

0 references

The alternating linear scheme for tensor optimization in the tensor train format

0 references

Computations in quantum tensor networks

0 references

Low-CP-rank tensor completion via practical regularization

0 references

Tensor Decompositions and Applications

0 references

A fast tri-factorization method for low-rank matrix recovery and completion

0 references

Hankel tensor-based model and \(L_1\)-Tucker decomposition-based frequency recovery method for harmonic retrieval problem

0 references

A practical introduction to tensor networks: Matrix product states and projected entangled pair states

0 references

Tensor-train decomposition

0 references

Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions

0 references

TT-cross approximation for multidimensional arrays

0 references

Three dimensional strongly symmetric circulant tensors

0 references

Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

0 references

Low-rank nonnegative tensor approximation via alternating projections and sketching

0 references

NF-3DLogTNN: an effective hyperspectral and multispectral image fusion method based on nonlocal low-fibered-rank regularization

0 references

A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation

0 references

Hot-SVD: higher order t-singular value decomposition for tensors based on tensor-tensor product

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Efficient alternating least squares algorithms for low multilinear rank approximation of tensors

0 references

Hankel tensors, Vandermonde tensors and their positivities

0 references

A TT-based hierarchical framework for decomposing high-order tensors

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S40314-023-02368-W

0 references

Sitelinks

Mathematics(1 entry)

mardi TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization