Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient Partition of N-Dimensional Intervals in the Framework of
  One-Point-Based Algorithms   In this paper, the problem of the minimal description of the structure of a
vector function f(x) over an $N$-dimensional interval is studied. Methods
adaptively subdividing the original interval in smaller subintervals and
evaluating f(x) at only one point within each subinterval are considered. Two
partition strategies traditionally used for solving this problem are analyzed.
A new partition strategy based on an efficient technique developed for diagonal
algorithms is proposed and studied.

37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
10
The categories of this paper are: q-bio
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
13
The categories of this paper are: quant-ph