Abstract
We present here strategies for searching the (unique) zero of a real function, or its n-th derivative; we assume no a priori bound on the value x of this zero. The proposed strategy performs logry + llogry+ ... +1 + log*ry evaluations of f to determine x = ɛy with error less than ɛ (here r depends only on n). An argument of slowly converning integrals shows that these strategies are essentially optimal.
Preview
Unable to display preview. Download preview PDF.
References
J.L. BENTLEY & A.C. YAO [76]: An almost optimal algorithm for unbounded searching, IPL, vol. 3, no 3 (1976) pp. 82–87.
N. BOURBAKI [76]: Théorie des fonctions de variables réelles, ch. V, app. no 8 (1976 3rd ed.), Hermann Paris.
S. EILENBERG [74]: Automata, languages, and machines, Vol. A, Academic Press (1974).
P. ELIAS [75]: Universal codework sets and representation of the integers, IEEE Trans. on Information theory, IT-21 (1975) pp. 194–203.
S. EVEN & M. RODEH [78]: Economical encoding of commas between strings, CACM, Vol. 21, no 4 (1978) pp. 315–317.
L. HYAFIL [77]: Optimal search for the zero of the n th derivative, IRIA/LABORIA, Rapport no 247 (1977).
R.M. KARP & W.L. MIRANKER [72]: Parallel minimax search for a maximum, J. of Comb. Theory 4 (1972) pp. 19–35.
H.P. KATSEFF [78]: Complexity dip in random infinite binary sequences, SIGACT Newsletters (Winter 1978) pp. 22–23.
J. KIEFER [53]: Sequential minimax search for a maximum, Proc. Ameri. Soc. 4 (1953) pp. 502–506.
D.E. KNUTH [75]: The art of computer programming, Vol. 3, Sorting and searching, Addison-Wesley (1975).
D.E. KNUTH [79]: Supernatural numbers. (Dedicated to Martin Gardner).
A. KOLMOGOROV [68]: Three approaches for defining the concept of information quantity, Selected Translations in Math. Stat. and Prob., AMS Publication (1968).
H.T. KUNG [76]: Synchronized and asynchronous parallel algorithms for multi-processors, in Proc. of a Symp. on Algorithms and Complexity (1976). Edited by J.F. Traub, Academic Press, 1976, pp. 153–200.
J. LINN [73]: General methods for parallel searching, Tech. Rep. no 61, Digital Systems Lab., Stanford University (1973).
P. MARTIN-LÖF [71]: Complexity oscillations in infinite binary sequences, Z. Wahrsheinlichkeitstheorie Verw. Geb. 19 (1971) pp. 225–230.
J.C. RAOULT, J. VUILLEMIN [79]: Optimal unbounded search strategies, Rapport LRI, no 33 (1979).
R.L. RIVEST, A.R. MEYER, D.J. KLEITMAN, J. SPENCER, K. WINKLMAN [78]: Coping with errors in binary search procedures, Proc. of the 10th annual ACM Symposium on Theory of Computing, San Diego (1978) pp. 227–232.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raoult, J.C., Vuillemin, J. (1980). Optimal unbounded search strategies. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_95
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive