|
Simplest sequential search algorithm for the largest value of a twice-differentiable function
G. S. Ganshin Krasnoyarsk State University
Abstract:
In this note we describe a sequential algorithm for the computation with specified accuracy on a segment of the largest value of a twice-differentiable function. The algorithm described does not require the computation of the values of the derivative.
Received: 23.06.1975
Citation:
G. S. Ganshin, “Simplest sequential search algorithm for the largest value of a twice-differentiable function”, Mat. Zametki, 19:6 (1976), 871–872; Math. Notes, 19:6 (1976), 508–509
Linking options:
https://www.mathnet.ru/eng/mzm7809 https://www.mathnet.ru/eng/mzm/v19/i6/p871
|
Statistics & downloads: |
Abstract page: | 237 | Full-text PDF : | 76 | First page: | 1 |
|