High Order Search Methods for Finding Roots-Reference-Cited by-同舟云学术

High Order Search Methods for Finding Roots

Published:1975-01 Issue:1 Volume:22 Page:51-60
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Micchelli C. A.¹,Miranker W. L.¹

Affiliation:

1. Mathematical Sciences Department, IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference4 articles.

1. BRENT R. Algorithms/or Minimzzation Without Derivatzves Prentice-Hall Englewood Cliffs N. J. 1973. 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. BURCHARD H Interpolation and approximation by generalized convex functions. Ph.D Diss. Purdue U. Lafayette ind. 1968.

3. Sequential minmax search for amaximum;KIEFER J;Proc. Amer. MathSoc.,1953

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal solution of nonlinear equations;Journal of Complexity;1985-12

2. The fundamental theorem of algebra and the interpolating envelope for totally positive perfect splines;Journal of Approximation Theory;1982-02

3. Some extremal properties of perfect splines and the pointwise Landau problem on the finite interval;Journal of Approximation Theory;1978-05

4. Optimal sequential and parallel seach for finding a root;Journal of Combinatorial Theory, Series A;1977-07

5. Moment Theory for Weak Chebyshev Systems with Applications to Monosplines, Quadrature Formulae and Best One-Sided $L^1 $-Approximation by Spline Functions with Fixed Knots;SIAM Journal on Mathematical Analysis;1977-04