Application of Parallel Computing to Obtain all Real Solutions of a High Degree Univariate Polynomial Equation

DOI

10.2991/metss-16.2016.107How to use a DOI?

Keywords

parallel computing, global convergence, a high degree univariate polynomial equation

Abstract

The efficient method, which combines the advantages of parallel computing and golden section, is put forward to solve a high degree univariate polynomial equation. This method can be used to overcome the shortcomings of common methods, which need to good initial values and may omit part of real solutions. Firstly, a simulation algorithm are provided. The golden section method is used to reduce the number of iterations and the parallel computing can efficiency calculate the solutions. Then, the stability and convergence of the method are strictly proved. Finally, numerical computations are employed to verify the proposed method. The results indicate that the proposed method can effectively improve the efficiency of solutions and obtain all the real solutions of the equation. The approach has high convergence rate and precision. It can be applied to the large scale problems arising from scientific and engineering computing.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Liying Wang
PY  - 2016/11
DA  - 2016/11
TI  - Application of Parallel Computing to Obtain all Real Solutions of a High Degree Univariate Polynomial Equation
BT  - Proceedings of the 2016 3rd International Conference on Management, Education Technology and Sports Science (METSS 2016)
PB  - Atlantis Press
SP  - 524
EP  - 528
SN  - 2352-5428
UR  - https://doi.org/10.2991/metss-16.2016.107
DO  - 10.2991/metss-16.2016.107
ID  - Wang2016/11
ER  -