Abstract
We describe an algorithm for the strict estimation of max x∈I f(x) whenf is analytic onI. If roundoff is neglected the error bound can be made arbitrarily small by an adaptive implementation. A majorant concept is utilized and an Algol program is given. Finally we outline the special application to the strict estimation of the range of a polynomial without any determination of the zeros of the derivative.
Similar content being viewed by others
References
N. Apostolatos, N. Kulisch, R. Krawczyk, B. Lortz, K. Nickel, H. Wipperman,The Algorithmic Language Triplex-Algol 60, Num. Math. 11 (1968), 175–180.
G. Dahlquist,On Rigorous Error Bounds in the Numerical Solution of Ordinary Differential Equations, Numerical Sol. of Nonlin. Diff. Eq., John Wiley 1966 (Ed. Greenspan).
R. Dussel, B. Schmitt, Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall, Computing 6 (1970), 35–60.
R. Moore,Interval Analysis, Prentice Hall 1966.
Ström,Absolutely Monotonic Majorants—A Tool for Automatic Strict Error Estimation in the Approximate Calculation of Linear Functionals, Rept. NA 70.23, Dept of Information Proc. Royal Institute of Technology, S-100 44 Stockholm 70, Sweden.
T. Ström,On the Use of Majorants for Strict Error Estimation of Numerical Solutions to Ordinary Differential Equations, Rept. Na 70.10 Dept of Information Proc. Royal Institute of Technology, S-100 44 Stockholm 70, Sweden.
W. Uhlmann, Zur Fehlerabschätzung bei Interpolationspolynomen, ZAMM 37 (1957), 73–74.
J. H. Wilkinson,Rounding Errors in Algebraic Processes, Her Majesty's Office, London 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ström, T. Strict estimation of the maximum of a function of one variable. BIT 11, 199–211 (1971). https://doi.org/10.1007/BF01934369
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01934369