| 摘要 |
PROBLEM TO BE SOLVED: To obtain all the real number solutions of an equation by solving: the problem that all the real number solutions of the n-th (integer of n≥1) equation of an integer coefficient X (F(X)=0) are to be obtained by using a method of genetic algorithm (abbreviated to GA henceforth); since a chromosome defined by GA consists of finite number of genes at most, solutions which can be expressed are also finite and even generating the solutions directly is impossible particularly when a circulation decimal or an irrational number is the solution; and the removing method of a factor with the irrational number as the solution from F(X) is the problem. SOLUTION: Gene arrangement corresponding to an integer (≥0) is defined as the chromosome. In the retrieval of the solution, the value of the chromosome is not made to be a solution candidate of F(X) directly, but a plurality of solution candidates of the form of a rational number or an irrational number are prepared based on the number. In addition, the factor candidate of F(X) having "all the conjugate root with respect to the one solution candidate" as a solution is retrieved. The solution is decided from whether F(X) can be divided out by the factor candidate. The factor candidate is m-th (positive integer n≥m) polynomial of the integer coefficient X. COPYRIGHT: (C)2005,JPO&NCIPI
|
