Variable Search Space Converging Genetic Algorithm for Solving System of Non-linear Equations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

Modified homotopy perturbation method for solving non-linear oscillator's ‎equations

In this paper a new form of the homptopy perturbation method is used for solving oscillator differential equation, which yields the Maclaurin series of the exact solution. Nonlinear vibration problems and differential equation oscillations have crucial importance in all areas of science and engineering. These equations equip a significant mathematical model for dynamical systems. The accuracy o...

متن کامل

A Genetic Algorithm for Solving General System of Equations

For solving linear system of equations is known several algorithms. Iteration algorithms are recommended for the large linear systems with sparse matrix. But in the case of general n x m matrices the classic iterative algorithms are not applicable with a few exceptions. For example in some cases the Lanczos type algorithms are adequate. The algorithm presented here based on the minimization of ...

متن کامل

Solving a System of Linear Equations by Homotopy Analysis Method

‎In this paper‎, ‎an efficient algorithm for solving a system of linear‎ ‎equations based on the homotopy analysis method is presented‎. ‎The‎ ‎proposed method is compared with the classical Jacobi iterative‎ ‎method‎, ‎and the convergence analysis is discussed‎. ‎Finally‎, ‎two‎ ‎numerical examples are presented to show the effectiveness of the‎ ‎proposed method.‎

متن کامل

‎a matrix lsqr algorithm for solving constrained linear operator equations

in this work‎, ‎an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$‎ ‎and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$‎ ‎where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$‎, ‎$mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$‎, ‎$ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Intelligent Systems

سال: 2020

ISSN: 2191-026X

DOI: 10.1515/jisys-2019-0233