The combinatorial of Artificial Bee Colony algorithm and Bisection method for solving Eigenvalue Problem
Publish place: Theory of Approximation and Applications، Vol: 14، Issue: 1
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 159
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_MSJI-14-1_009
تاریخ نمایه سازی: 28 فروردین 1402
Abstract:
The aim of this paper is to find eigenvalues of square matrix A based on the Artificial Bee Colony algorithm and the Bisection method(BIABC ). At first, we obtain initial interval [a,b] that included all eigenvalues based on Gerschgorin's theorem, and then by using Artificial Bee Colony algorithm(ABC) at this interval to generate initial value for each eigenvalue. The bisection method improves them until the best values of eigenvalues with arbitrary accuracy will be achieved. This enables us to find eigenvalues with arbitrary accuracy without computing the derivative of the characteristic polynomial of the given matrix. We illustrate the proposed method with Some numerical examples.
Keywords:
Authors
Parvaneh Mansouri
Department of Computer Science, Faculty of Science, Arak Branch, Islamic Azad University, Arak, Iran.