• a finite iterative algorithm for solving the generalized (p,q)-reflexive solution of the linear systems of matrix equations

    نویسندگان :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 886
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     in this paper, we proposed an algorithm for solving the linear systems of matrix equations view the mathml source over the generalized (p,q)-reflexive matrix xlrn×m (view the mathml source). according to the algorithm, the solvability of the problem can be determined automatically. when the problem is consistent over the generalized (p,q)-reflexive matrix view the mathml source, for any generalized (p,q)-reflexive initial iterative matrices view the mathml source, the generalized (p,q)-reflexive solution can be obtained within finite iterative steps in the absence of roundoff errors. the unique least-norm generalized (p,q)-reflexive solution can also be derived when the appropriate initial iterative matrices are chosen. a sufficient and necessary condition for which the linear systems of matrix equations is inconsistent is given. furthermore, the optimal approximate solution for a group of given matrices view the mathml source can be derived by finding the least-norm generalized (p,q)-reflexive solution of a new corresponding linear system of matrix equations. finally, we present a numerical example to verify the theoretical results of this paper.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها