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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*
* Methods for the class Diff_dsdx2
*
* (see file diff.h for documentation).
*
*/
/*
* Copyright (c) 2005 Jerome Novak
*
* This file is part of LORENE.
*
* LORENE is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2
* as published by the Free Software Foundation.
*
* LORENE 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 LORENE; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
char diff_dsdx2_C[] = "$Header: /cvsroot/Lorene/C++/Source/Diff/diff_dsdx2.C,v 1.3 2014/10/13 08:52:50 j_novak Exp $" ;
/*
* $Id: diff_dsdx2.C,v 1.3 2014/10/13 08:52:50 j_novak Exp $
* $Log: diff_dsdx2.C,v $
* Revision 1.3 2014/10/13 08:52:50 j_novak
* Lorene classes and functions now belong to the namespace Lorene.
*
* Revision 1.2 2014/10/06 15:13:04 j_novak
* Modified #include directives to use c++ syntax.
*
* Revision 1.1 2005/01/10 16:34:52 j_novak
* New class for 1D mono-domain differential operators.
*
*
* $Header: /cvsroot/Lorene/C++/Source/Diff/diff_dsdx2.C,v 1.3 2014/10/13 08:52:50 j_novak Exp $
*
*/
// C headers
#include <cassert>
#include <cstdlib>
// Lorene headers
#include "diff.h"
#include "proto.h"
namespace Lorene {
namespace {
int nap = 0 ;
Matrice* tab[MAX_BASE*Diff::max_points] ;
int nr_done[Diff::max_points] ;
}
Diff_dsdx2::Diff_dsdx2(int base_r, int nr) : Diff(base_r, nr) {
initialize() ;
}
Diff_dsdx2::Diff_dsdx2(const Diff_dsdx2& diff_in) : Diff(diff_in) {
assert (nap != 0) ;
}
Diff_dsdx2::~Diff_dsdx2() {}
void Diff_dsdx2::initialize() {
if (nap == 0) {
for (int i=0; i<max_points; i++) {
nr_done[i] = -1 ;
for (int j=0; j<MAX_BASE; j++)
tab[j*max_points+i] = 0x0 ;
}
nap = 1 ;
}
return ;
}
void Diff_dsdx2::operator=(const Diff_dsdx2& diff_in) {
assert (nap != 0) ;
Diff::operator=(diff_in) ;
}
const Matrice& Diff_dsdx2::get_matrice() const {
bool done = false ;
int indice ;
for (indice =0; indice<max_points; indice++) {
if (nr_done[indice] == npoints) {
if (tab[base*max_points + indice] != 0x0) done = true ;
break ;
}
if (nr_done[indice] == -1)
break ;
}
if (!done) { //The computation must be done ...
if (indice == max_points) {
cerr << "Diff_dsdx2::get_matrice() : no space left!!" << '\n'
<< "The value of Diff.max_points must be increased..." << endl ;
abort() ;
}
nr_done[indice] = npoints ;
tab[base*max_points + indice] = new Matrice(npoints, npoints) ;
Matrice& resu = *tab[base*max_points + indice] ;
resu.set_etat_qcq() ;
double* vect = new double[npoints] ;
for (int i=0; i<npoints; i++) {
for (int j=0; j<npoints; j++)
vect[j] = 0. ;
vect[i] = 1. ;
d2sdx2_1d(npoints, &vect, base << TRA_R) ;
for (int j=0; j<npoints; j++)
resu.set(j,i) = vect[j] ;
}
delete [] vect ;
}
return *tab[base*max_points + indice] ;
}
ostream& Diff_dsdx2::operator>>(ostream& ost) const {
ost << " d2 / dx2 " << endl ;
return ost ;
}
}
|
