Rank-One Approximation to High Order Tensors
From MaRDI portal
Publication:2784363
DOI10.1137/S0895479899352045zbMath1001.65036MaRDI QIDQ2784363
Publication date: 23 April 2002
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
algorithmssingular value decompositionleast squares methodtensor decompositionlow rank approximationJacobi Gauss-Newton procedureRayleigh-Newton iteration
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Multilinear algebra, tensor calculus (15A69)
Related Items (only showing first 100 items - show all)
Robust Eigenvectors of Symmetric Tensors ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ Alternating Least Squares as Moving Subspace Correction ⋮ Unnamed Item ⋮ On best rank one approximation of tensors ⋮ A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Algorithms for structure preserving best rank-one approximations of partially symmetric tensors ⋮ A review on octupolar tensors ⋮ A parameter-less algorithm for tensor co-clustering ⋮ Dehomogenization for completely positive tensors ⋮ Minimization methods for approximating tensors and their comparison ⋮ Extended tensor decomposition model reduction methods: training, prediction, and design under uncertainty ⋮ Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration ⋮ Low Rank Symmetric Tensor Approximations ⋮ The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor ⋮ Further results on tensor nuclear norms ⋮ Spectral norm of a symmetric tensor and its computation ⋮ Singular vectors of orthogonally decomposable tensors ⋮ The Condition Number of Join Decompositions ⋮ Nuclear norm of higher-order tensors ⋮ Iterative algorithms for solving some tensor equations ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ The maximally entangled symmetric state in terms of the geometric measure ⋮ Multiresolution Low-rank Tensor Formats ⋮ Algebraic Methods for Tensor Data ⋮ Generalized low rank approximations of matrices ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ CLASSIFICATION OF ENTANGLEMENT IN SYMMETRIC STATES ⋮ Improved Approximation of the Sum of Random Vectors by the Skew Normal Distribution ⋮ Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors ⋮ Generalized low rank approximations of matrices ⋮ The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes ⋮ GRADIENT FLOWS FOR OPTIMIZATION IN QUANTUM INFORMATION AND QUANTUM DYNAMICS: FOUNDATIONS AND APPLICATIONS ⋮ Subtracting a best rank-1 approximation may increase tensor rank ⋮ Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ On the perturbation of rank-one symmetric tensors ⋮ New eigenvalue inclusion sets for tensors ⋮ Numerical Computation for Orthogonal Low-Rank Approximation of Tensors ⋮ News Algorithms for tensor decomposition based on a reduced functional ⋮ Unnamed Item ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Unnamed Item ⋮ On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor ⋮ Structured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors ⋮ Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Two \(S\)-type \( Z\)-eigenvalue inclusion sets for tensors ⋮ Convergence rate analysis for the higher order power method in best rank one approximations of tensors ⋮ Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Inference for low-rank tensors -- no need to debias ⋮ The cubic spherical optimization problems ⋮ Tensor decomposition in electronic structure calculations on 3D Cartesian grids ⋮ On the spectral problem for trivariate functions ⋮ A new method of moments for latent variable models ⋮ \(p\)-norm SDD tensors and eigenvalue localization ⋮ Black box low tensor-rank approximation using fiber-crosses ⋮ Some bounds for \(H\)-eigenpairs and \(Z\)-eigenpairs of a tensor ⋮ Bounds for the Z-eigenpair of general nonnegative tensors ⋮ Eigenvalues and invariants of tensors ⋮ A new \(S\)-type eigenvalue inclusion set for tensors and its applications ⋮ Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Iterative methods for computing vibrational spectra ⋮ Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems ⋮ A survey on the spectral theory of nonnegative tensors ⋮ Structured multi-way arrays and their applications ⋮ On the estimates of the \(\mathcal{Z}\)-eigenpair for an irreducible nonnegative tensor ⋮ Condition numbers for the tensor rank decomposition ⋮ Some variational principles for \(Z\)-eigenvalues of nonnegative tensors ⋮ Monotonically convergent algorithms for symmetric tensor approximation ⋮ Krylov-type methods for tensor computations.I ⋮ Orthogonal and unitary tensor decomposition from an algebraic perspective ⋮ The symmetric rank and decomposition of \(m\)-order \(n\)-dimensional \((n = 2,3,4)\) symmetric tensors over the binary field ⋮ On the convergence of alternating minimization methods in variational PGD ⋮ \(E\)-eigenvalue localization sets for tensors ⋮ A contemporary linear representation theory for ordinary differential equations: multilinear algebra in folded arrays (folarrs) perspective and its use in multidimensional case ⋮ Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors ⋮ On the computational benefit of tensor separation for high-dimensional discrete convolutions ⋮ A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Bounds for the spectral radius of nonnegative tensors ⋮ Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices ⋮ \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors ⋮ A probabilistic foundation for dynamical systems: theoretical background and mathematical formulation ⋮ On global convergence of alternating least squares for tensor approximation ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Data compression under constraints of causality and variable finite memory ⋮ Alternating direction method for bi-quadratic programming ⋮ An equi-directional generalization of adaptive cross approximation for higher-order tensors ⋮ Numerically explicit potentials for the homogenization of nonlinear elastic heterogeneous materials
Uses Software
This page was built for publication: Rank-One Approximation to High Order Tensors
