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} \)
From MaRDI portal
Publication:2068845
DOI10.1007/s43069-021-00107-7zbMath1480.65105OpenAlexW3216024474MaRDI QIDQ2068845
Publication date: 20 January 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-021-00107-7
Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Numerical methods for matrix equations (65F45)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Iterative least-squares solutions of coupled sylvester matrix equations
- An eigenvalue problem for even order tensors with its applications
- Moore–Penrose inverse of tensors via Einstein product
- Solving Multilinear Systems via Tensor Inversion
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A Hessenberg-Schur method for the problem AX + XB= C
- Tensor inversion and its application to the tensor equations with Einstein product
- An iterative algorithm to solve the generalized Sylvester tensor equations
- An optimal preconditioner for tensor equations involving Einstein product
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Gradient based iterative algorithms for solving a class of matrix equations
- Further results on generalized inverses of tensors via the Einstein product
- Tensor Analysis
- Iterative algorithms for solving some tensor equations
- Unnamed Item
This page was built for publication: 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} \)