Abstract
How might simple real zeros of real valued continuous k-th derivatives g(k) be efficiently estimated, by using only values of g and points in dom(g)? A standard approach to these questions entails successively ehoosing a (prescribed) total of n>k points to be the abscissae for sequences of k-th divided differences,whose signs are then used to locate the zeros. Of central importance is the particular rule (or strategy) by which these n points are selected.In this paper, it is shown how analysis of a maximal solution of a Booth inequality determines the most efficient strategy for k=14.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bellman, Dynamic Programming. Princeton University Press, Princeton, 4-th Edition, 1965.
R.S. Booth, Location of zeros of derivatives. SIAM J. Appl. Math. 15 (1967), 1496–1501.
R.S. Booth, Random search for zeroes. J. Math. Anal. Appl. 20 (1967), 239–257.
U. R.S. Booth, Location of zeros of derivatives. II. SIAM J. Appl. Math. 17 (1969), 409–415.
R.S. Booth, An odd order search problem. SIAM J. Alg. Disc. Meth. 3 (1982), 135–143.
E. Isaacson and H.B. Keller, Analysis of numerical methods. John Wiley and Sons, Inc., New York, London, Sydney, 1966.
J. Kiefer, Sequential minimax search for a maximum. Proc. Amer. Math. Soc. 4 (1953), 502–506.
J. Kiefer, Optimal sequential search and approximation methods under minimum regularity assumptions. SIAM J. Appl. Math. 5 (1957), 105–136.
R.J. Wallace, Sequential search for zeroes of derivatives. In: W. Walter (ed.). General Inequalities 4 (pp.151–167), Birkhauser Verlag, Basel, 1984.
R.J. Wallace, The maximal solution of a restricted subadditive inequality in numerical analysis. Aequationes Mathematicae. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Birkhäuser Verlag Basel
About this chapter
Cite this chapter
Wallace, R.J. (1987). An Even Order Search Problem. In: Walter, W. (eds) General Inequalities 5. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik Série internationale d’Analyse numérique, vol 80. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-7192-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7192-1_15
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-0348-7194-5
Online ISBN: 978-3-0348-7192-1
eBook Packages: Springer Book Archive