COMPUTATION COMPLEXITY OF THE EULER ALGORITHMS FOR THE ROOTS OF COMPLEX POLYNOMIALS.

Title: COMPUTATION COMPLEXITY OF THE EULER ALGORITHMS FOR THE ROOTS OF COMPLEX POLYNOMIALS.
Identifier: AAI8611353
identifier: 8611353
Creator: KIM, MYONG-HI.
Contributor: Mike Shub
Date: 1986
Language: English
Publisher: City University of New York.
Subject: Mathematics
Abstract: In this thesis we show that the Euler type algorithms find (i) a complex number z such that (VBAR)f(z)(VBAR) 0, approximately, with 6672(d(d+log(VBAR)log (epsilon)(VBAR))M(26(d+(VBAR)log (epsilon)(VBAR)) binary bit operations, (ii) an approximate zero for a polynomial of degree d without multiple roots with average bit complexity approximately, 6672(d M(26d))) binary bit operations, where M(n) denotes the bit complexity for the multiplication of two n-digit numbers.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.
Program: Mathematics

Media: COMPUTATION COMPLEXITY OF THE EULER ALGORITHMS FOR THE ROOTS OF COMPLEX POLYNOMIALS.