Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
The Sylvester tensor equation (STE) is a popular problem in tensor-based computation. It can arise for example in discretizing high-dimensional linear partial differential equations using finite difference or spectral methods. STE is equivalent to a system of linear equations but solving this linear system can be a real challenge. This nicely written paper deals with approximate solutions to the STE with low rank right-hand sides obtained by Arnoldi-based methods. At first, some basic definitions, tensor notations, and common operations related to tensors adopted in this paper are introduced. Theoretical results for obtaining an approximate solution using the Arnoldi algorithm for the linear system where the right-hand side tensor is of rank one are presented. Then, using the fact that the tensor of order \(N\) can be decomposed by the CP decomposition, the authors propose two new approaches to extract approximate solutions to STE with low rank right-hand sides: block and global Krylov methods, namely Arnoldi-based algorithms. The first approach is based on the use of the block Arnoldi algorithm for the coefficient matrices in STE, which leads to the reduced Sylvester tensor. The second approach is based on the use of the global Arnoldi algorithm in order to obtain the low-dimensional Sylvester tensor. The algorithms are summarized in the paper. Besides, expressions of the corresponding residual tensors and their norms for each approach are given. Three numerical examples showing the effectiveness of the proposed approaches are presented.
- Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side
- Extended Krylov subspace methods for solving Sylvester and Stein tensor equations
- Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Low rank approximate solutions to large Sylvester matrix equations
- A gradient based iterative solutions for Sylvester tensor equations
- A mixed collocation-finite difference method for 3D microscopic heat transport problems
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- A projection method to solve linear systems in tensor format
- A survey of multilinear subspace learning for tensor data
- Algorithms for Numerical Analysis in High Dimensions
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Block Krylov subspace methods for solving large Sylvester equations
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Fundamental tensor operations for large-scale data analysis using tensor network formats
- Global FOM and GMRES algorithms for matrix equations
- Gradient based iterative algorithms for solving a class of matrix equations
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Krylov subspace methods for linear systems with tensor product structure
- Low rank approximate solutions to large Sylvester matrix equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Recursive blocked algorithms for linear systems with Kronecker product structure
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Tensor Decompositions and Applications
- Low-rank quadrature-based tensor approximation of the Galerkin projected Newton/Yukawa kernels
- The LSQR method for solving tensor least-squares problems
- Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
- Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side
- Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Extended Krylov subspace methods for solving Sylvester and Stein tensor equations
- Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side
- Tensor product-type methods for solving Sylvester tensor equations
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
- Alternative Arnoldi process for ill-conditioned tensor equations with application to image restoration
- A modified block Hessenberg method for low-rank tensor Sylvester equation
- On low-rank tensor train approximability for linear nearest neighbor systems
This page was built for publication: Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780401)
