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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/*
* Copyright (c) 2004 Philippe Grandclement
*
* 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 sol_elliptic_only_zec_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/PDE/sol_elliptic_only_zec.C,v 1.4 2014/10/13 08:53:30 j_novak Exp $" ;
/*
* $Id: sol_elliptic_only_zec.C,v 1.4 2014/10/13 08:53:30 j_novak Exp $
* $Log: sol_elliptic_only_zec.C,v $
* Revision 1.4 2014/10/13 08:53:30 j_novak
* Lorene classes and functions now belong to the namespace Lorene.
*
* Revision 1.3 2014/10/06 15:16:10 j_novak
* Modified #include directives to use c++ syntax.
*
* Revision 1.2 2004/08/24 09:14:44 p_grandclement
* Addition of some new operators, like Poisson in 2d... It now requieres the
* GSL library to work.
*
* Also, the way a variable change is stored by a Param_elliptic is changed and
* no longer uses Change_var but rather 2 Scalars. The codes using that feature
* will requiere some modification. (It should concern only the ones about monopoles)
*
* Revision 1.1 2004/06/22 08:49:58 p_grandclement
* Addition of everything needed for using the logarithmic mapping
*
*
* $Header $
*
*/
// Header C :
#include <cstdlib>
#include <cmath>
// Headers Lorene :
#include "tbl.h"
#include "mtbl_cf.h"
#include "map.h"
#include "param_elliptic.h"
//----------------------------------------------
// Version Mtbl_cf
//----------------------------------------------
namespace Lorene {
Mtbl_cf elliptic_solver_only_zec (const Param_elliptic& ope_var, const Mtbl_cf& source, double val) {
// Verifications d'usage sur les zones
int nz = source.get_mg()->get_nzone() ;
assert (nz>1) ;
assert (source.get_mg()->get_type_r(nz-1) == UNSURR) ;
// donnees sur la zone
int nr, nt, np ;
//Rangement des valeurs intermediaires
Tbl *so ;
Tbl *sol_hom ;
Tbl *sol_part ;
// Rangement des solutions, avant raccordement
Mtbl_cf solution_part(source.get_mg(), source.base) ;
Mtbl_cf solution_hom_un(source.get_mg(), source.base) ;
Mtbl_cf solution_hom_deux(source.get_mg(), source.base) ;
Mtbl_cf resultat(source.get_mg(), source.base) ;
solution_part.annule_hard() ;
solution_hom_un.annule_hard() ;
solution_hom_deux.annule_hard() ;
resultat.annule_hard() ;
// Computation of the SP and SH's in the ZEC ...
int conte_start = 0 ;
for (int l=0 ; l<nz-1 ; l++) {
nt = source.get_mg()->get_nt(l) ;
np = source.get_mg()->get_np(l) ;
for (int k=0 ; k<np+1 ; k++)
for (int j=0 ; j<nt ; j++)
conte_start ++ ;
}
int conte = conte_start ;
int zone = nz-1 ;
nr = source.get_mg()->get_nr(zone) ;
nt = source.get_mg()->get_nt(zone) ;
np = source.get_mg()->get_np(zone) ;
for (int k=0 ; k<np+1 ; k++)
for (int j=0 ; j<nt ; j++) {
if (ope_var.operateurs[conte] != 0x0) {
// Calcul de la SH
sol_hom = new Tbl(ope_var.operateurs[conte]->get_solh()) ;
//Calcul de la SP
so = new Tbl(nr) ;
so->set_etat_qcq() ;
for (int i=0 ; i<nr ; i++)
so->set(i) = source(zone, k, j, i) ;
sol_part = new Tbl(ope_var.operateurs[conte]->get_solp(*so)) ;
// Rangement dans les tableaux globaux ;
for (int i=0 ; i<nr ; i++) {
solution_part.set(zone, k, j, i) = (*sol_part)(i) ;
if (sol_hom->get_ndim()==1)
solution_hom_un.set(zone, k, j, i) = (*sol_hom)(i) ;
else
{
solution_hom_un.set(zone, k, j, i) = (*sol_hom)(0,i) ;
solution_hom_deux.set(zone, k, j, i) = (*sol_hom)(1,i) ;
}
}
delete so ;
delete sol_hom ;
delete sol_part ;
}
conte ++ ;
}
//---------------------------------------------------------
// ON impose la bonne CL ... CASE ONLY SPHERICAL RIGHT NOW
//---------------------------------------------------------
// C'est pas simple toute cette sombre affaire...
// Que le cas meme nombre de points dans chaque domaines...
int start = conte_start ;
for (int k=0 ; k<1 ; k++)
for (int j=0 ; j<1 ; j++) {
if (ope_var.operateurs[start] != 0x0) {
// Valeurs en -1 :
double facteur = ((val-ope_var.F_minus(nz-1, k, j))/
ope_var.G_minus(nz-1) -
ope_var.operateurs[start]->val_sp_minus()) /
ope_var.operateurs[start]->val_sh_one_minus() ;
// Zec
nr = source.get_mg()->get_nr(nz-1) ;
for (int i=0 ; i<nr ; i++)
resultat.set(nz-1,k,j,i) = solution_part(nz-1,k,j,i) +
facteur*solution_hom_un(nz-1,k,j,i) ;
}
start ++ ;
}
return resultat;
}
}
|
