ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The Down-Hill Method of Solving f(z) = 0
Full text PdfPdf (126 KB)
Source Journal of the ACM (JACM) archive
Volume 4 ,  Issue 2  (April 1957) table of contents
Pages: 148 - 150  
Year of Publication: 1957
ISSN:0004-5411
Author
James A. Ward  Holloman Air Force Base, New Mexico
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 32,   Citation Count: 5
Additional Information:

cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320868.320873
What is a DOI?

CITED BY  5
G. N. Lance, Solution of Algebraic and Transcendental Equations on an Automatic Digital Computer, Journal of the ACM (JACM), v.6 n.1, p.97-101, Jan. 1959
H. Bach, On the downhill method, Communications of the ACM, v.12 n.12, p.675-677, Dec. 1969
H. Bach, Algorithm 365: complex root finding [C5], Communications of the ACM, v.12 n.12, p.686-687, Dec. 1969
D. H. Lehmer, A Machine Method for Solving Polynomial Equations, Journal of the ACM (JACM), v.8 n.2, p.151-162, April 1961
George C. Caldwell, A Note on the Downhill Method, Journal of the ACM (JACM), v.6 n.2, p.223-225, April 1959

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Number-theoretic computations (e.g., factoring, primality testing)


General Terms:
Theory, Verification


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player