| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636261 | Applied Mathematics and Computation | 2007 | 19 Pages |
Abstract
Presented here is a quasi-shrinking rectangle algorithm that computes a complex zero of a polynomial or transcendental function. This method has been implemented using several quasi-random number sequences and the results of several test examples are presented. The performance of this algorithm is based on a ranked comparison of relative error and time complexity versus several pseudo-random number sequences.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Andrea Reese,