تعداد نشریات | 161 |
تعداد شمارهها | 6,479 |
تعداد مقالات | 70,032 |
تعداد مشاهده مقاله | 123,013,088 |
تعداد دریافت فایل اصل مقاله | 96,244,976 |
Some new restart vectors for explicitly restarted Arnoldi method | ||
Journal of Algorithms and Computation | ||
مقاله 8، دوره 51، شماره 1، شهریور 2019، صفحه 91-105 اصل مقاله (415.14 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2019.71545 | ||
نویسندگان | ||
Zeinab Abadi1؛ Seyed Abolfazl Shahzadeh Fazeli* 2؛ Seyed Mehdi Karbassi3 | ||
1Department of mathematical Sciences, Faculty of science, Yazd University | ||
2Department of Computer Science, Yazd University, Yazd, Iran. | ||
3Department of Mathematical Science, Yazd University, Yazd, Iran. | ||
چکیده | ||
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of the methods have been tested by numerical examples. The results show that we can obtain a good acceleration of the convergence compared to original ERAM. | ||
کلیدواژهها | ||
Large eigenvalue problems؛ Krylov subspace؛ Arnoldi method؛ Explicitly restarted؛ Restarting vector | ||
آمار تعداد مشاهده مقاله: 385 تعداد دریافت فایل اصل مقاله: 325 |