»ã±¨±êÌâ (Title)£ºEfficient iterative algorithms for solving Sylvester quaternion tensor equations

ÖÐÎıêÌ⣺Çó½âËÄÔªÊýÕÅÁ¿·½³ÌµÄÓÐЧµþ´úËã·¨

»ã±¨ÈË (Speaker)£º ÕÅÑï ½ÌÊÚ£¨¼ÓÄôóÂüÄáÍаʹóѧ£©

»ã±¨¹¦·ò (Time)£º2023Äê11ÔÂ29ÈÕ(ÖÜÈý) 9:00

»ã±¨µØÖ· (Place)£º У±¾²¿ F309

Ô¼ÇëÈË(Inviter)£ºÍõÇäÎÄ

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºIn this talk, we will introduce some effective iterative algorithms to solve generalized Sylvester tensor equations over quaternions which includes several well-studied matrix/tensor equations as special cases. We also discuss the convergence of these algorithms within finite iteration steps for any initial tensor in the absence of round-off errors. Some numerical examples are presented to illustrate the practicality and validity of the proposed algorithms.