Numerical Algorithms for Computing an Arbitrary Singular Value of a Tensor Sum
We consider computing an arbitrary singular value of a tensor sum: <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>T</mi><mo>:</mo><mo>=</mo><msub><mi>I&...
Main Authors: | Asuka Ohashi, Tomohiro Sogabe |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/10/3/211 |
Similar Items
-
On computing the minimum singular value of a tensor sum
by: Ohashi A., et al.
Published: (2019-09-01) -
Low-Rank Tensor Completion by Sum of Tensor Nuclear Norm Minimization
by: Yaru Su, et al.
Published: (2019-01-01) -
(R, P)-absolutely summing dual operators on the projective tensor products of spaces
by: Dumitru Popa
Published: (2001-05-01) -
A Modified Conjugate Residual Method and Nearest Kronecker Product Preconditioner for the Generalized Coupled Sylvester Tensor Equations
by: Tao Li, et al.
Published: (2022-05-01) -
Application of Tensor Decomposition to Reduce the Complexity of Neural Min-Sum Channel Decoding Algorithm
by: Qingle Wu, et al.
Published: (2023-02-01)