# Finding the roots of polynomial equations: an algorithm with linear command.

Revista Matemática Complutense (2000)

- Volume: 13, Issue: 2, page 305-323
- ISSN: 1139-1138

## Access Full Article

top## Abstract

top## How to cite

topBeauzamy, Bernard. "Finding the roots of polynomial equations: an algorithm with linear command.." Revista Matemática Complutense 13.2 (2000): 305-323. <http://eudml.org/doc/44480>.

@article{Beauzamy2000,

abstract = {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.},

author = {Beauzamy, Bernard},

journal = {Revista Matemática Complutense},

keywords = {Ecuaciones polinómicas; Algoritmos numéricos; algorithm; roots of polynomials; linear command},

language = {eng},

number = {2},

pages = {305-323},

title = {Finding the roots of polynomial equations: an algorithm with linear command.},

url = {http://eudml.org/doc/44480},

volume = {13},

year = {2000},

}

TY - JOUR

AU - Beauzamy, Bernard

TI - Finding the roots of polynomial equations: an algorithm with linear command.

JO - Revista Matemática Complutense

PY - 2000

VL - 13

IS - 2

SP - 305

EP - 323

AB - 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.

LA - eng

KW - Ecuaciones polinómicas; Algoritmos numéricos; algorithm; roots of polynomials; linear command

UR - http://eudml.org/doc/44480

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.