پیوندهای مفید
آمار
| تعداد نشریات | 32 |
| تعداد شمارهها | 849 |
| تعداد مقالات | 8,227 |
| تعداد مشاهده مقاله | 52,514,577 |
| تعداد دریافت فایل اصل مقاله | 8,959,072 |
A GPU / CPU faster Block Arnoldi Method for Solving Large-Scale Lyapunov Equation | ||
| Journal of Mathematical Modeling | ||
| مقالات آماده انتشار، اصلاح شده برای چاپ، انتشار آنلاین از تاریخ 29 فروردین 1405 اصل مقاله (448.6 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22124/jmm.2026.32050.2896 | ||
| نویسنده | ||
| Ilias abdaoui* | ||
| ENSA OUJDA | ||
| چکیده | ||
| Krylov methods have proven effective in solving large-scale matrix equations with sparse coefficients, in particular through the use of the extended Arnoldi process, which involves the inverse of the matrix coefficients in the projection subspace. This approach has significantly reduced the time and number of iterations needed to find a suitable solution. In this paper, we are interested on solving the low-rank Lyapunov equation whether in the continuous or discrete case. We propose to enhance the convergence time by modifying the Block Arnoldi process so that the Krylov projection subspace contains additional blocks from the inverse of the square coefficient of this equation. Our intention is to benefit from these additional informations, similar to the extended Arnoldi version, without incorporating them at each iteration, thus preventing any impact on the convergence speed. To confirm the effectiveness of the proposed method, some numerical results obtained using CPU and GPU implementations are provided. | ||
| کلیدواژهها | ||
| Krylov subspaces؛ block Arnoldi process؛ Lyapunov equation | ||
|
آمار تعداد مشاهده مقاله: 2 تعداد دریافت فایل اصل مقاله: 1 |
||