An error analysis of two related quadrature methods for computing zeros of analytic functions
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
A parallel method for large sparse generalized eigenvalue problems using a GridRPC system
Future Generation Computer Systems
A new transform for solving the noisy complex exponentials approximation problem
Journal of Approximation Theory
A master-worker type eigensolver for molecular orbital computations
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
A parallel method for large sparse generalized eigenvalue problems by OmniRPC in a grid environment
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Hi-index | 7.29 |
We consider the quadrature method developed by Kravanja et al. (BIT 39 (4) (1999) 646) for computing all the zeros of an analytic function that lie inside the unit circle. A new perturbation result for generalized eigenvalue problems allows us to obtain a detailed upper bound for the error between the zeros and their approximations. To the best of our knowledge, it is the first time that such an error estimate is presented for any quadrature method for computing zeros of analytic functions. Numerical experiments illustrate our results.