On the complexity of approximate solution of some fundamental problems of algebraic computations.

Title: On the complexity of approximate solution of some fundamental problems of algebraic computations.
Identifier: AAI9707149
identifier: 9707149
Creator: Sadikou, Akimou Oluwa-Labe.
Contributor: Adviser: Victor Pan
Date: 1996
Language: English
Publisher: City University of New York.
Subject: Computer Science | Mathematics
Abstract: Our subject is the algorithms for approximate solution of some problems of univariate polynomial computations, namely, polynomial division, multipoint evaluation and interpolation, and solving a polynomial equation. We approach this subject by using some nonstandard techniques of algorithm design and analysis, which leads us to some improvement of the previously known estimates for the computational complexity, to some promise of improving practical performance of the known algorithms, and to some new insights into the existent approaches to the solution.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.

Media: On the complexity of approximate solution of some fundamental problems of algebraic computations.