How to solve polynomial equation on complex field by numerical method I have a question to ask you, that is, how to write a program to solve the polynomial equation in the complex field (for example, f (x) = A2 * x ^ 2 + A1 * x + A0 = 0). Now I use the argument principle (in short, I integrate f '(x) / F (x) on the complex plane. If there is an internal solution, the integral is not zero, otherwise it is zero), The solution is determined by continuously narrowing the integral range. However, for the higher order (greater than 10 orders), it is not enough. Is there any algorithm improvement that can improve the accuracy and speed?

How to solve polynomial equation on complex field by numerical method I have a question to ask you, that is, how to write a program to solve the polynomial equation in the complex field (for example, f (x) = A2 * x ^ 2 + A1 * x + A0 = 0). Now I use the argument principle (in short, I integrate f '(x) / F (x) on the complex plane. If there is an internal solution, the integral is not zero, otherwise it is zero), The solution is determined by continuously narrowing the integral range. However, for the higher order (greater than 10 orders), it is not enough. Is there any algorithm improvement that can improve the accuracy and speed?

If it is a polynomial equation with real coefficients, then we can use linsger Zhao's method (split factor method) to decompose the equation into the quadratic factor of real coefficients, so as to find the complex roots. This is a very effective and fast method, and can deal with the equation of any high power