A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Herbert S. Wilf Department of Mathematics, University of Pennsylvania, Philadelphia, PA
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 25 Issue 3, July 1978
Pages 415-420
ACM New York, NY, USA
table of contents doi>10.1145/322077.322084
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane Published by ACM 1978 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 542
· Citation Count: 6


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder