Abstract
Motivated by the effectiveness of Krylov projection methods and the CP decomposition of tensors, which is a low rank decomposition, we propose Arnoldi-based methods (block and global) to solve Sylvester tensor equation with low rank right-hand sides. We apply a standard Krylov subspace method to each coefficient matrix, in order to reduce the main problem to a projected Sylvester tensor equation, which can be solved by a global iterative scheme. We show how to extract approximate solutions via matrix Krylov subspaces basis. Several theoretical results such as expressions of residual and its norm are presented. To show the performance of the proposed approaches, some numerical experiments are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
