Name
Abstract | ||
|---|---|---|
Homotopy continuation is a most efficient numerical method for finding all isolated solutions of system of polynomial equations, and finding minimal multi-homogeneous Bezout number is a basic problem of homotopy continuation. This paper presents a problem-specific genetic algorithm for finding minimal multi-homogeneous Bezout number The algorithm is easy to implement and easy to be parallelized for large scale problems. It can find the minimal multi-homogeneous Bezout number in probability 1. Numerical results indicate that the proposed algorithm is reliable and efficient. The algorithm offers a competitive alternative for minimal multi-homogeneous Bezout number problem. Meanwhile, it extends the application fields of genetic algorithms. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICIS.2008.38 | ACIS-ICIS |
Keywords | Field | DocType |
upper bound,probability,civil engineering,computer architecture,heuristics,genetic algorithm,numerical method,information science,polynomials,mathematics,genetic algorithms | Mathematical optimization,Polynomial,Upper and lower bounds,Homogeneous,Computer science,System of polynomial equations,Algorithm,Heuristics,Homotopy continuation,Numerical analysis,Genetic algorithm | Conference |
Volume | Issue | Citations |
null | null | 1 |
PageRank | References | Authors |
0.39 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongshu Yan | 1 | 1 | 0.39 |
| Jintao Zhang | 2 | 1 | 0.39 |
| Bo Yu | 3 | 53 | 11.35 |
| Changtong Luo | 4 | 36 | 5.66 |
| Shao-Liang Zhang | 5 | 92 | 19.06 |