An iterative scheme for a class of generalized Sylvester matrix equations | ||
| AUT Journal of Mathematics and Computing | ||
| دوره 5، شماره 3، 2024، صفحه 195-215 اصل مقاله (1.94 M) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2024.22444.1159 | ||
| نویسندگان | ||
| Mehdi Dehghan* 1؛ Gholamreza Karamali2؛ Akbar Shirilord1 | ||
| 1Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran | ||
| 2Faculty of Basic Sciences, Shahid Sattari Aeronautical University of Sciences and Technology, South Mehrabad, Tehran, Iran | ||
| چکیده | ||
| In this study based on the accelerated over relaxation (AOR) method we make an iterative scheme for solving generalized Lyapunov matrix equation $$ {A}{X}+{X}{B}+\sum_{j=1}^{m}{N}_j{X}{M}_j={C},$$ over complex or real matrices. Then we analyze the convergence of the new iterative method in detail. There have been discussions for the calculation of optimal parameters. Finally a numerical example is given to demonstrate the capability of the new method. | ||
| کلیدواژهها | ||
| Optimal parameters؛ Complex matrices؛ Generalized Sylvester matrix equation؛ Accelerated over relaxation (AOR) method؛ Control theory | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 738 تعداد دریافت فایل اصل مقاله: 1,157 |
||
| تعداد نشریات | 9 |
| تعداد شمارهها | 459 |
| تعداد مقالات | 5,790 |
| تعداد مشاهده مقاله | 8,570,993 |
| تعداد دریافت فایل اصل مقاله | 7,100,528 |