Orthogonal Tensor Decompositions

From MaRDI portal
Revision as of 16:12, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2784344

DOI10.1137/S0895479800368354zbMath1005.15020MaRDI QIDQ2784344

Tamara G. Kolda

Publication date: 23 April 2002

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)




Related Items (94)

Convergence rate analysis for the higher order power method in best rank one approximations of tensorsNew estimations on the upper bounds for the nuclear norm of a tensorInference for low-rank tensors -- no need to debiasOn the spectral problem for trivariate functionsA new method of moments for latent variable modelsDimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebraThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 TensorBlack box low tensor-rank approximation using fiber-crossesSuccessive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric TensorsNumerical operator calculus in higher dimensionsA randomized algorithm for a tensor-based generalization of the singular value decompositionOn approximation algorithm for orthogonal low-rank tensor approximationITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATIONProper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problemsOn the convergence of a greedy rank-one update algorithm for a class of linear systemsNonconvex Low-Rank Tensor Completion from Noisy DataCondition numbers for the tensor rank decompositionPartial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorizationThe convex geometry of linear inverse problemsA Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 TermsMonotonically convergent algorithms for symmetric tensor approximationGreedy Approaches to Symmetric Orthogonal Tensor DecompositionLeast-Squares Proper Generalized Decompositions for Weakly Coercive Elliptic ProblemsLinear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximationsOrthogonal and unitary tensor decomposition from an algebraic perspectiveThe condition number of many tensor decompositions is invariant under Tucker compressionRank properties and computational methods for orthogonal tensor decompositionsA contemporary linear representation theory for ordinary differential equations: multilinear algebra in folded arrays (folarrs) perspective and its use in multidimensional caseMatrix-variate and higher-order probabilistic projectionsSuccessive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensorsA tensor decomposition approach to data compression and approximation of ND systemsA proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approachIterative tensor eigen rank minimization for low-rank tensor completionA fully symmetric nonlinear biorthogonal decomposition theory for random fieldsFurther results on tensor nuclear normsA probabilistic foundation for dynamical systems: theoretical background and mathematical formulationTensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.Singular vectors of orthogonally decomposable tensorsThe Condition Number of Join DecompositionsCharacterization of sampling patterns for low-tt-rank tensor retrievalProper generalized decomposition for nonlinear convex problems in tensor Banach spacesOn Orthogonal Tensors and Best Rank-One Approximation RatioIterative algorithms for solving some tensor equationsPartitioned treatment of uncertainty in coupled domain problems: a separated representation approachTensor-based projection depthNon-intrusive low-rank separated approximation of high-dimensional stochastic modelsExploiting Efficient Representations in Large-Scale Tensor DecompositionsTensor inversion and its application to the tensor equations with Einstein productDiagonalizable higher degree forms and symmetric tensorsMultiresolution Low-rank Tensor FormatsThe Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global ConvergenceRange-Separated Tensor Format for Many-Particle ModelingGeneralized low rank approximations of matricesLow rank Tucker-type tensor approximation to classical potentialsTensor-product approximation to operators and functions in high dimensionsWeighted Moore-Penrose inverses of arbitrary-order tensorsBayesian Modeling of Temporal Dependence in Large Sparse Contingency TablesNumerical multilinear algebra and its applicationsSimplex Factor Models for Multivariate Unordered Categorical DataOn approximate diagonalization of third order symmetric tensors by orthogonal transformationsComputational and statistical tradeoffs via convex relaxationWell-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximationsFast tensor method for summation of long‐range potentials on 3D lattices with defectsGeneralized low rank approximations of matricesGRADIENT FLOWS FOR OPTIMIZATION IN QUANTUM INFORMATION AND QUANTUM DYNAMICS: FOUNDATIONS AND APPLICATIONSThe tensor rank problem over the quaternionsOrthogonal tensor neighborhood preserving embedding for facial expression recognitionA survey of multilinear subspace learning for tensor dataLocally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized ProofTensor ranks for the inversion of tensor-product binomialsBounds on strongly orthogonal ranks of tensorsA numerical solver for high dimensional transient Fokker-Planck equation in modeling polymeric fluidsRandom Projections for Low Multilinear Rank TensorsSymmetric tensor decomposition by an iterative eigendecomposition algorithmFlip-flop spectrum-revealing QR factorization and its applications to singular value decompositionZ-eigenvalue methods for a global polynomial optimization problemCP decomposition and weighted clique problemAn inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensorsDifferential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensorsSpline approximation, Kronecker products and multilinear formsA least-squares approximation of partial differential equations with high-dimensional random inputsNumerical Computation for Orthogonal Low-Rank Approximation of TensorsTucker tensor analysis of Matérn functions in spatial statisticsIterative algorithms for the post-processing of high-dimensional dataImages, Frames, and Connectionist HierarchiesA locally convergent Jacobi iteration for the tensor singular value problemA Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensorsNews Algorithms for tensor decomposition based on a reduced functionalA low-rank tensor-based algorithm for face recognitionUnnamed ItemLower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least SquaresGlobally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor DiagonalizationGeneralized inverses of Boolean tensors via the Einstein productNondegeneracy of eigenvectors and singular vector tuples of tensors







This page was built for publication: Orthogonal Tensor Decompositions