پیوندهای مفید
آمار
| تعداد نشریات | 31 |
| تعداد شمارهها | 748 |
| تعداد مقالات | 7,128 |
| تعداد مشاهده مقاله | 10,280,174 |
| تعداد دریافت فایل اصل مقاله | 6,911,969 |
Residual norm steepest descent based iterative algorithms for Sylvester tensor equations | ||
| Journal of Mathematical Modeling | ||
| مقاله 1، دوره 2، شماره 2، خرداد 2015، صفحه 115-131 اصل مقاله (313.54 K) | ||
| نوع مقاله: Research Article | ||
| نویسندگان | ||
| Fatemeh Panjeh Ali Beik* ؛ Salman Ahmadi-Asl | ||
| چکیده | ||
| Consider the following consistent Sylvester tensor equation \[\mathscr{X}\times_1 A +\mathscr{X}\times_2 B+\mathscr{X}\times_3 C=\mathscr{D},\] where the matrices $A,B, C$ and the tensor $\mathscr{D}$ are given and $\mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and its modified version for solving the mentioned Sylvester tensor equation without setting the restriction of the existence of a unique solution. Numerical experiments are reported which confirm the validity of the presented results. | ||
| کلیدواژهها | ||
| Sylvester tensor equation؛ iterative algorithm؛ Convergence | ||
|
آمار تعداد مشاهده مقاله: 3,564 تعداد دریافت فایل اصل مقاله: 2,984 |
||