A parallel algorithm to find the zeros of an analytic function.
by
Michael H. Meylan
Masey University - Albany

Many problems in spectal theory, for example finding the eigenvalues of a matrix, can be transformed to finding the zeros of some analytic function (in the matrix example the characteristic polynomial). In more sophisticated spectral problems, especially problems in which the spectral parameter appears non-linearly, zero search algorithms seem to present a simple method for find eigenvalues. In this seminar, I will present my attempts to program an algorithm to perform this zeros search on a parallel architecture computer. Since the zero search algorithm is very computationally expensive the use of a parallel computer offers the possibility of performing calculations which were previously impossible. However, there are some difficulties in programming algorithms in parallel which I will discuss.

Date received: October 22, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cahf-38.