A new method is proposed for finding all maxima and minima of a multivariable function f in a box X(0). In this method, the maxima and the minima are calculated by dividing X(0) into subrogions recursively and bounding the ranges of f in the each subregion applying affine arithmetic and discarding the subrogions which don't possess the possibility of including the point that the maximum (minimum) value occurs. Moreover, to discard more subrogions in initial stage, i.e. to speed the new method, two algorithms are introduced. And to show the efficiency of the new method, some numerical examples are implemented.
|ジャーナル||LECTURE NOTES IN COMPUTER SCIENCE|
|出版ステータス||Published - 2005 9 12|
|イベント||Third International Conference on Numerical Analysis and Its Applications, NAA 2004 - Rousse, Bulgaria|
継続期間: 2004 6 29 → 2004 7 3
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)