A gradient based iterative solutions for sylvester tensor equations

36Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper is concerned with the numerical solution of the Sylvester tensor equation, which includes the Sylvester matrix equation as special case. By applying hierarchical identification principle proposed by Ding and Chen, 2005, and by using tensor arithmetic concepts, an iterative algorithm and its modification are established to solve the Sylvester tensor equation. Convergence analysis indicates that the iterative solutions always converge to the exact solution for arbitrary initial value. Finally, some examples are provided to show that the proposed algorithms are effective. © 2013 Zhen Chen and Linzhang Lu.

Cite

CITATION STYLE

APA

Chen, Z., & Lu, L. (2013). A gradient based iterative solutions for sylvester tensor equations. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/819479

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free