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
High Order Search Methods for Finding Roots
Full text PdfPdf (529 KB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 1  (January 1975) table of contents
Pages: 51 - 60  
Year of Publication: 1975
ISSN:0004-5411
Authors
C. A. Micchelli  Mathematical Sciences Department, IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY
W. L. Miranker  Mathematical Sciences Department, IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

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/321864.321869
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BRENT, R. Algorithms/or Minimzzation Without Derivatzves Prentice-Hall, Englewood Cliffs, N. J., 1973.
 
2
BURCHARD, H Interpolation and approximation by generalized convex functions. Ph.D Diss., Purdue U., Lafayette, ind., 1968.
 
3
K,tRLEN, S, AND STUDDEN, W. Tchebycheff Systems: With Apphcations in Analysis and Sta. tist~cs. Wiley, New York, 1966.
 
4
KIEFER, J. Sequential minmax search for amaximum. Proc. Amer. MathSoc. 4 (1953),502-506.

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)

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching


General Terms:
Algorithms, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
C. A. Micchelli: colleagues
W. L. Miranker: colleagues

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