A Quasi-shrinking rectangle algorithm for complex zeros of a function
作者:
Highlights:
•
摘要
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.
论文关键词:Complex zero,Low discrepancy sequence,Pseudo-random number,Quasi-random number,Relative error,Time complexity
论文评审过程:Available online 22 August 2006.
论文官网地址:https://doi.org/10.1016/j.amc.2006.07.012