Simplest sequential search algorithm for the largest value of a~twice-differentiable function
Matematičeskie zametki, Tome 19 (1976) no. 6, pp. 871-872
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{MZM_1976_19_6_a6,
author = {G. S. Ganshin},
title = {Simplest sequential search algorithm for the largest value of a~twice-differentiable function},
journal = {Matemati\v{c}eskie zametki},
pages = {871--872},
publisher = {mathdoc},
volume = {19},
number = {6},
year = {1976},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1976_19_6_a6/}
}
TY - JOUR AU - G. S. Ganshin TI - Simplest sequential search algorithm for the largest value of a~twice-differentiable function JO - Matematičeskie zametki PY - 1976 SP - 871 EP - 872 VL - 19 IS - 6 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/MZM_1976_19_6_a6/ LA - ru ID - MZM_1976_19_6_a6 ER -
G. S. Ganshin. Simplest sequential search algorithm for the largest value of a~twice-differentiable function. Matematičeskie zametki, Tome 19 (1976) no. 6, pp. 871-872. http://geodesic.mathdoc.fr/item/MZM_1976_19_6_a6/