2021/08/27 by Fatih İdiz, Fatih Idiz, Idiz, Fatih
Computer Science · Engineering · Mathematics · #Control Systems and Identification #Extremum Seeking Control Systems #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Numerical Analysis (math.NA) #cs.NA #math.NA
paper · pdf · doi:10.48550/arxiv.2108.12514
9 pages, 1 figure
arxiv created 2021/08/27 · openalex publication_date 2021/08/27 · arxiv updated 2021/08/31 · openalex created_date 2021/09/13 · openalex updated_date 2026/07/28
For a continuous function f defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is similar to the bisection method, to approximate those maximum and minimum values. We analyze the order of the convergence of the method and the error at the k-th step. Then we discuss the pros and cons of the method. Finally, we apply our method for some special classes of functions to obtain nicer results. At the end, we write a Matlab script which implements our algorithm.