Optimal search algorithm for extrema of a discrete periodic bimodal function
β Scribed by Boris S Veroy
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 616 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper describes an optimal algorithm for searching for a minimum (or a maximum) of a discrete periodic bimodal function of period P. Recursive computing is used to prove the optimality of the search algorithm. An application of the algorithm for a clustering analysis of a data communication network is provided.
π SIMILAR VOLUMES
This paper analyzes the performance of two parallel algorithms for solving the linear-quadratic optimal control problem arising in discrete-time periodic linear systems. The algorithms perform a sequence of orthogonal reordering transformations on formal matrix products associated with the periodic