1 /* integration/qpsrt2.c
3 * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Brian Gough
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or (at
8 * your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
20 /* The smallest interval has the largest error. Before bisecting
21 decrease the sum of the errors over the larger intervals
22 (error_over_large_intervals) and perform extrapolation. */
25 increase_nrmax (gsl_integration_workspace * workspace);
28 increase_nrmax (gsl_integration_workspace * workspace)
31 int id = workspace->nrmax;
34 const size_t * level = workspace->level;
35 const size_t * order = workspace->order;
37 size_t limit = workspace->limit ;
38 size_t last = workspace->size - 1 ;
40 if (last > (1 + limit / 2))
42 jupbnd = limit + 1 - last;
49 for (k = id; k <= jupbnd; k++)
51 size_t i_max = order[workspace->nrmax];
53 workspace->i = i_max ;
55 if (level[i_max] < workspace->maximum_level)
67 large_interval (gsl_integration_workspace * workspace)
69 size_t i = workspace->i ;
70 const size_t * level = workspace->level;
72 if (level[i] < workspace->maximum_level)