-
-
Notifications
You must be signed in to change notification settings - Fork 295
/
bench_solver_direct.c
109 lines (83 loc) · 3.84 KB
/
bench_solver_direct.c
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
/*****************************************************************************
*
* MODULE: Grass PDE Numerical Library
* AUTHOR(S): Soeren Gebbert, Berlin (GER) Dec 2006
* soerengebbert <at> gmx <dot> de
*
* PURPOSE: benchmarking the direct solvers
*
* COPYRIGHT: (C) 2000 by the GRASS Development Team
*
* This program is free software under the GNU General Public
* License (>=v2). Read the file COPYING that comes with GRASS
* for details.
*
*****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <grass/glocale.h>
#include <grass/gmath.h>
#include "test_gmath_lib.h"
#include <sys/time.h>
/* prototypes */
static int bench_solvers(int rows);
/* ************************************************************************* */
/* Performe the solver unit tests ****************************************** */
/* ************************************************************************* */
int bench_solvers_direct(int rows) {
G_message(_("\n++ Running direct solver benchmark ++"));
bench_solvers(rows);
return 1;
}
/* *************************************************************** */
/* Test all implemented solvers for sparse and normal matrix *** */
/* *************************************************************** */
int bench_solvers(int rows) {
G_math_les *les;
struct timeval tstart;
struct timeval tend;
G_message("\t * benchmarking gmath lu decomposition solver with unsymmetric matrix\n");
les = create_normal_unsymmetric_les(rows);
gettimeofday(&tstart, NULL);
G_math_solver_lu(les->A, les->x, les->b, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time gmath lu decomposition: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
G_message("\t * benchmarking lu ccmath decomposition solver with unsymmetric matrix\n");
les = create_normal_unsymmetric_les(rows);
gettimeofday(&tstart, NULL);
G_math_solv(les->A, les->b, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time ccmath lu decomposition: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
G_message("\t * benchmarking gauss elimination solver with unsymmetric matrix\n");
les = create_normal_unsymmetric_les(rows);
gettimeofday(&tstart, NULL);
G_math_solver_gauss(les->A, les->x, les->b, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time gauss elimination: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
G_message("\t * benchmarking gmath cholesky decomposition solver with symmetric matrix\n");
les = create_normal_symmetric_les(rows);
gettimeofday(&tstart, NULL);
G_math_solver_cholesky(les->A, les->x, les->b, les->rows, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time gmath cholesky decomposition: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
G_message("\t * benchmarking ccmath cholesky decomposition solver with symmetric matrix\n");
les = create_normal_symmetric_les(rows);
gettimeofday(&tstart, NULL);
G_math_solvps(les->A, les->b, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time ccmath cholesky decomposition: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
G_message("\t * benchmarking gmath cholesky band matrix decomposition solver with symmetric band matrix\n");
les = create_symmetric_band_les(rows);
gettimeofday(&tstart, NULL);
G_math_solver_cholesky_sband(les->A, les->x, les->b, les->rows, les->rows);
gettimeofday(&tend, NULL);
printf("Computation time cholesky band matrix decomposition: %g\n", compute_time_difference(tstart, tend));
G_math_free_les(les);
return 1;
}