-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBVPSolverStats.cpp
More file actions
66 lines (58 loc) · 2.09 KB
/
Copy pathBVPSolverStats.cpp
File metadata and controls
66 lines (58 loc) · 2.09 KB
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
// Copyright (C) 2016 William H. Greene
//
// 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 3 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, see <http://www.gnu.org/licenses/>.
#include <stdio.h>
#include <kinsol/kinsol.h>
#include "BVPSolverStats.h"
BVPSolverStats::BVPSolverStats(bool recordStats) :
recordStats(recordStats)
{
numFuncEvals = numSolveIterations = numJacEval = 0;
numFuncEvalJac = 0;
numPtsCurrentMesh = 0;
numMeshUpdates = 0;
}
void BVPSolverStats::update(void *kinsolMemory, size_t numMeshPts) {
if (!recordStats) return;
numMeshUpdates++;
numPtsCurrentMesh = numMeshPts;
long nfevals;
KINGetNumFuncEvals(kinsolMemory, &nfevals);
numFuncEvals += nfevals;
long nSolvIters;
KINGetNumNonlinSolvIters(kinsolMemory, &nSolvIters);
numSolveIterations += nSolvIters;
long numJac, numFuncJac = 0;
#if USE_KLU
KINGetNumJacEvals(kinsolMemory, &numJac);
#else
KINGetNumJacEvals(kinsolMemory, &numJac);
KINGetNumFuncEvals(kinsolMemory, &numFuncJac);
#endif
numJacEval += numJac;
numFuncEvalJac += numFuncJac;
}
void BVPSolverStats::incrementJacobianFuncCalls(int numCalls) {
numFuncEvalJac += numCalls;
}
void BVPSolverStats::print() const
{
if (!recordStats) return;
printf("Number of mesh refinements = %d.\n", numMeshUpdates);
printf("Number of points in final mesh = %d.\n", numPtsCurrentMesh);
printf("Number of residual function evaluations = %ld\n", numFuncEvals);
printf("Number of nonlinear solver iterations = %ld\n", numSolveIterations);
printf("%ld Jacobian evaluations requiring %ld residual function evaluations.\n",
numJacEval, numFuncEvalJac);
}