Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
From MaRDI portal
Publication:780401
DOI10.1007/s11075-020-00874-0zbMath1450.65039OpenAlexW3007346980MaRDI QIDQ780401
El M. Sadek, Abdeslem Hafid Bentbib, Smahane El-Halouy
Publication date: 15 July 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00874-0
Matrix equations and identities (15A24) Multilinear algebra, tensor calculus (15A69) Numerical methods for matrix equations (65F45)
Related Items (8)
Extended Krylov subspace methods for solving Sylvester and Stein tensor equations ⋮ Tensor product-type methods for solving Sylvester tensor equations ⋮ Deflated and restarted Krylov subspace methods for Sylvester tensor equations ⋮ Unnamed Item ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- A gradient based iterative solutions for Sylvester tensor equations
- A survey of multilinear subspace learning for tensor data
- Fundamental tensor operations for large-scale data analysis using tensor network formats
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- A mixed collocation-finite difference method for 3D microscopic heat transport problems
- Global FOM and GMRES algorithms for matrix equations
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Recursive blocked algorithms for linear systems with Kronecker product structure
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Low rank approximate solutions to large Sylvester matrix equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Gradient based iterative algorithms for solving a class of matrix equations
- A projection method to solve linear systems in tensor format
- Algorithms for Numerical Analysis in High Dimensions
- Block Krylov subspace methods for solving large Sylvester equations
This page was built for publication: Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side