1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
/* integration/qpsrt2.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/* The smallest interval has the largest error. Before bisecting
decrease the sum of the errors over the larger intervals
(error_over_large_intervals) and perform extrapolation. */
static int
increase_nrmax (gsl_integration_workspace * workspace);
static int
increase_nrmax (gsl_integration_workspace * workspace)
{
int k;
int id = workspace->nrmax;
int jupbnd;
const size_t * level = workspace->level;
const size_t * order = workspace->order;
size_t limit = workspace->limit ;
size_t last = workspace->size - 1 ;
if (last > (1 + limit / 2))
{
jupbnd = limit + 1 - last;
}
else
{
jupbnd = last;
}
for (k = id; k <= jupbnd; k++)
{
size_t i_max = order[workspace->nrmax];
workspace->i = i_max ;
if (level[i_max] < workspace->maximum_level)
{
return 1;
}
workspace->nrmax++;
}
return 0;
}
static int
large_interval (gsl_integration_workspace * workspace)
{
size_t i = workspace->i ;
const size_t * level = workspace->level;
if (level[i] < workspace->maximum_level)
{
return 1 ;
}
else
{
return 0 ;
}
}
|
