Iterative algorithms for solving some tensor equations

DOI10.1080/03081087.2018.1452889zbMath1415.65103OpenAlexW2793728421WikidataQ130115827 ScholiaQ130115827MaRDI QIDQ5378508

Xiangjian Xu, Qing-Wen Wang

Publication date: 3 June 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1452889

zbMATH Keywords

tensoriterative algorithmmultilinear systemtensor equationEinstein product

Mathematics Subject Classification ID

Related Items (27)

Hermitian and skew-Hermitian splitting methods for solving a tensor equation ⋮ The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint ⋮ Noise-tolerant continuous-time Zhang neural networks for time-varying Sylvester tensor equations ⋮ On RGI algorithms for solving Sylvester tensor equations ⋮ ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION ⋮ Solving coupled tensor equations via higher order LSQR methods ⋮ Fourth-order tensor Riccati equations with the Einstein product ⋮ The least-squares solution with the least norm to a system of tensor equations over the quaternion algebra ⋮ A system of coupled two-sided Sylvester-type tensor equations over the quaternion algebra ⋮ A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations ⋮ Conjugate gradient-like methods for solving general tensor equation with Einstein product ⋮ Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ N-mode minimal tensor extrapolation methods ⋮ Solving a system of two-sided Sylvester-like quaternion tensor equations ⋮ An iterative algorithm to solve the generalized Sylvester tensor equations ⋮ A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors ⋮ A rapid and powerful iterative method for computing inverses of sparse tensors with applications ⋮ A constraint system of coupled two-sided Sylvester-like quaternion tensor equations ⋮ Computing tensor generalized inverses via specialization and rationalization ⋮ Numerical study on Moore-Penrose inverse of tensors via Einstein product ⋮ A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems ⋮ Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks ⋮ Iterative methods for solving Sylvester transpose tensor equation \(\mathcal A\star_N\mathcal X\star_M\mathcal{B}+\mathcal{C}\star_M\mathcal X^T\star_N\mathcal{D}=\mathcal{E} \) ⋮ The general solution to a system of coupled Sylvester-type quaternion tensor equations involving \(\eta\)-Hermicity ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems

Cites Work

• Tensor Decompositions and Applications
• Perron-Frobenius theorem for nonnegative tensors
• An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\)
• A general product of tensors with applications
• Eigenvalues of a real supersymmetric tensor
• An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
• Orthogonal Tensor Decompositions
• Rank-One Approximation to High Order Tensors
• Moore–Penrose inverse of tensors via Einstein product
• Solving Multilinear Systems via Tensor Inversion
• Block Tensor Unfoldings
• A Multilinear Singular Value Decomposition
• Further results on generalized inverses of tensors via the Einstein product

This page was built for publication: Iterative algorithms for solving some tensor equations