Finding de roots of polynomial equations: an algorithm with linear command

• Autores: Bernard Beauzamy
• Localización: Revista matemática complutense, ISSN-e 1988-2807, ISSN 1139-1138, Vol. 13, Nº 2, 2000, págs. 305-324
• Idioma: español
• Enlaces
  • Texto completo
• Resumen

  • We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.