English

An Approach to Solve Linear Equations Using a Time-Variant Adaptation Based Hybrid Evolutionary Algorithm

Neural and Evolutionary Computing 2013-04-16 v1 Numerical Analysis

Abstract

For small number of equations, systems of linear (and sometimes nonlinear) equations can be solved by simple classical techniques. However, for large number of systems of linear (or nonlinear) equations, solutions using classical method become arduous. On the other hand evolutionary algorithms have mostly been used to solve various optimization and learning problems. Recently, hybridization of evolutionary algorithm with classical Gauss-Seidel based Successive Over Relaxation (SOR) method has successfully been used to solve large number of linear equations; where a uniform adaptation (UA) technique of relaxation factor is used. In this paper, a new hybrid algorithm is proposed in which a time-variant adaptation (TVA) technique of relaxation factor is used instead of uniform adaptation technique to solve large number of linear equations. The convergence theorems of the proposed algorithms are proved theoretically. And the performance of the proposed TVA-based algorithm is compared with the UA-based hybrid algorithm in the experimental domain. The proposed algorithm outperforms the hybrid one in terms of efficiency.

Keywords

Cite

@article{arxiv.1304.3200,
  title  = {An Approach to Solve Linear Equations Using a Time-Variant Adaptation Based Hybrid Evolutionary Algorithm},
  author = {A. R. M. Jalal Uddin Jamali and M. M. A. Hashem and Md. Bazlar Rahman},
  journal= {arXiv preprint arXiv:1304.3200},
  year   = {2013}
}

Comments

arXiv admin note: text overlap with arXiv:1304.2097

R2 v1 2026-06-21T23:57:47.974Z