The combinatorial of Artificial Bee Colony algorithm and Bisection method for solving Eigenvalue Problem

Theory of Approximation and Applications

مقاله 9، دوره 14، شماره 1، مرداد 2020، صفحه 109-117   

نوع مقاله: Research Articles

نویسنده

Parvaneh Mansouri^*

Department of Computer Science, Faculty of Science, Arak Branch, Islamic Azad University, Arak, Iran.

چکیده

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.

کلیدواژه‌ها

Bisection method؛ Root-Finding method؛ Eigenvalue Problem؛ Artificial Bee Colony algorithm