Abstract
This paper is concerned with studying the relaxed gradient-based iterative method based on tensor format to solve the Sylvester tensor equation. From the information given by the previous steps, we further develop a modified relaxed gradient-based iterative method which converges faster than the method above. Under some suitable conditions, we prove that the introduced methods are convergent to the unique solution for any initial tensor. At last, we provide some numerical examples to show that our methods perform much better than the GI algorithm proposed by Chen and Lu (Math. Probl. Eng. 2013) both in the number of iteration steps and the elapsed CPU time.
Sign-in/Register to access full text options 
Free) 
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 call
