File: cmp_raccord.C

package info (click to toggle)
lorene 0.0.0~cvs20161116%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, stretch
  • size: 26,444 kB
  • ctags: 13,953
  • sloc: cpp: 212,946; fortran: 21,645; makefile: 1,750; sh: 4
file content (252 lines) | stat: -rw-r--r-- 6,970 bytes parent folder | download | duplicates (2)
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
/*
 *   Copyright (c) 2000-2001 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 as published by
 *   the Free Software Foundation; either version 2 of the License, or
 *   (at your option) any later version.
 *
 *   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 cmp_raccord_C[] = "$Header: /cvsroot/Lorene/C++/Source/Cmp/cmp_raccord.C,v 1.4 2014/10/13 08:52:48 j_novak Exp $" ;

/*
 * $Id: cmp_raccord.C,v 1.4 2014/10/13 08:52:48 j_novak Exp $
 * $Log: cmp_raccord.C,v $
 * Revision 1.4  2014/10/13 08:52:48  j_novak
 * Lorene classes and functions now belong to the namespace Lorene.
 *
 * Revision 1.3  2014/10/06 15:13:03  j_novak
 * Modified #include directives to use c++ syntax.
 *
 * Revision 1.2  2003/10/03 15:58:45  j_novak
 * Cleaning of some headers
 *
 * Revision 1.1.1.1  2001/11/20 15:19:27  e_gourgoulhon
 * LORENE
 *
 * Revision 2.1  2000/09/07  13:19:58  phil
 * *** empty log message ***
 *
 * Revision 2.0  2000/06/06  12:18:27  phil
 * *** empty log message ***
 *
 *
 * $Header: /cvsroot/Lorene/C++/Source/Cmp/cmp_raccord.C,v 1.4 2014/10/13 08:52:48 j_novak Exp $
 *
 */

//standard
#include <cstdlib>
#include <cmath>

// LORENE
#include "matrice.h"
#include "cmp.h"
#include "proto.h"


namespace Lorene {
Matrice matrice_raccord_pair (int cont, double alpha_kernel) {
    
    Matrice systeme (cont, cont) ;
    systeme.set_etat_qcq() ;
    for (int i=0 ; i<cont ; i++)
	for (int j=0 ; j<cont ; j++)
	    systeme.set(i, j) = 0 ;
    
    double somme ;
    for (int i=0 ; i<cont ; i++)
	for (int k=0 ; k<cont ; k++)
	    if (k<= 2*i) {
	    somme = 1 ;
	    for (int boucle=0 ; boucle<k ; boucle++)
		somme *= (4*i*i-boucle*boucle)/(2.*boucle+1.)/alpha_kernel ;
	    systeme.set(k, i) = somme ;
	}
    int inf = (cont%2 == 1) ? (cont-1)/2 : (cont-2)/2 ;
    systeme.set_band (cont-1, inf) ;
    systeme.set_lu() ;
    return systeme ;
}

Matrice matrice_raccord_impair (int cont, double alpha_kernel) {
    
    Matrice systeme (cont, cont) ;
    systeme.set_etat_qcq() ;
    for (int i=0 ; i<cont ; i++)
	for (int j=0 ; j<cont ; j++)
	    systeme.set(i, j) = 0 ;
    
    double somme ;
    for (int i=0 ; i<cont ; i++)
	for (int k=0 ; k<cont ; k++)
	    if (k<= 2*i+1) {
	    somme = 1 ;
	    for (int boucle=0 ; boucle<k ; boucle++)
		somme *= (pow(2*i+1, 2.)-boucle*boucle)/(2.*boucle+1.)/alpha_kernel ;
	    systeme.set(k, i) = somme ;
	}
    int inf = (cont%2 == 0) ? cont/2 : (cont-1)/2 ;
    systeme.set_band (cont-1, inf) ;
    systeme.set_lu() ;
    return systeme ;
}


Tbl sec_membre_raccord (Tbl coef, int cont, double alpha_shell) {
    
    assert (coef.get_etat() != ETATNONDEF) ;
    int nr = coef.get_dim(0) ;
    
    Tbl sec_membre(cont) ;
    sec_membre.set_etat_qcq() ;
    for (int i=0 ; i<cont ; i++)
	sec_membre.set(i) = 0 ;
    
    double somme ;
    for (int i=0 ; i<nr ; i++)
	for (int k=0 ; k<cont ; k++)
	    if (k<= i) {
	    somme = 1 ;
	    for (int boucle=0 ; boucle<k ; boucle++)
		somme *= (i*i-boucle*boucle)/(2.*boucle+1.)/alpha_shell ;
	    if ((i+k)%2 == 0)
		sec_membre.set(k) += coef(i)*somme ;
	    else
		sec_membre.set(k) -= coef(i)*somme ;
	}
    
    return sec_membre ;
}


Tbl regularise (Tbl coef, int nr, int base_r) {
    
    assert ((base_r == R_CHEBI) || (base_r == R_CHEBP)) ;
    assert (coef.get_etat() != ETATNONDEF) ;
    int cont = coef.get_dim(0) ;
    assert (nr >= cont) ;
    
    Tbl resu (nr) ;
    resu.set_etat_qcq() ;
    
    double* x4coef = new double[nr] ;
    for (int i=0 ; i<cont ; i++)
	x4coef[i] = coef(i) ;
    for (int i=cont ; i<nr ; i++)
	x4coef[i] = 0 ;
    double* x6coef = new double[nr] ;
    
    multx2_1d (nr, &x4coef, base_r) ;
    multx2_1d (nr, &x4coef, base_r) ;
    for (int i=0 ; i<nr ; i++)
	x6coef[i] = x4coef[i] ;
    multx2_1d (nr, &x6coef, base_r) ;
    
    for (int i=0 ; i<nr ; i++)
	resu.set(i) = 3*x4coef[i]-2*x6coef[i] ;
    
    delete [] x4coef ;
    delete [] x6coef ;
    
    return resu ;
}



void Cmp::raccord (int aux) {
    assert (etat != ETATNONDEF) ;
    
    assert (aux >=0) ;
    int cont = aux+1 ;
    
    const Map_af* mapping = dynamic_cast<const Map_af*>(get_mp() ) ; 

    if (mapping == 0x0) {
	cout << 
	"raccord : The mapping does not belong to the class Map_af !"
	    << endl ; 
	abort() ;
    }
    
    assert (mapping->get_mg()->get_type_r(1) == FIN) ;
    assert (mapping->get_mg()->get_type_r(0) == RARE) ;
    
    // On passe en Ylm et vire tout dans la zone interne...
    va.coef() ;
    va.ylm() ;
    va.set_etat_cf_qcq() ;
    va.c_cf->t[0]->annule_hard() ;
    
    // Confort :
    int nz = mapping->get_mg()->get_nzone() ;
    int nbrer_kernel = mapping->get_mg()->get_nr(0) ;
    int nbrer_shell  = mapping->get_mg()->get_nr(1) ;
    
    int nbret_kernel = mapping->get_mg()->get_nt(0) ;
    int nbret_shell  = mapping->get_mg()->get_nt(1) ;
    
    int nbrep_kernel = mapping->get_mg()->get_np(0) ;
    int nbrep_shell  = mapping->get_mg()->get_np(1) ;
    
    double alpha_kernel = mapping->get_alpha()[0] ;
    double alpha_shell  = mapping->get_alpha()[1] ;
    
    int base_r, m_quant, l_quant ;
    
    for (int k=0 ; k<nbrep_kernel+1 ; k++)
	for (int j=0 ; j<nbret_kernel ; j++)
	    if (nullite_plm(j, nbret_kernel, k,nbrep_kernel, va.base) == 1)
		 if (nullite_plm(j, nbret_shell, k, nbrep_shell, va.base) == 1)
	{
		// calcul des nombres quantiques :
	    donne_lm(nz, 0, j, k, va.base, m_quant, l_quant, base_r) ;
	    assert ((base_r == R_CHEBP) || (base_r == R_CHEBI)) ;
	    
	    Matrice systeme(cont, cont) ;
	    
	    Tbl facteur (nbrer_kernel) ;
	    facteur.annule_hard() ;
	    for (int i=0 ; i<nbrer_shell ; i++)
		if (i<nbrer_kernel)
		    facteur.set(i) = (*va.c_cf)(1, k, j, i) ;
	    
	    Tbl sec_membre (sec_membre_raccord (facteur, cont, alpha_shell)) ;
	   
	    if (base_r == R_CHEBP)
		systeme = matrice_raccord_pair (cont, alpha_kernel) ;	    
	    else
		systeme = matrice_raccord_impair (cont, alpha_kernel) ;
	    
	    Tbl soluce (systeme.inverse(sec_membre)) ;
	    Tbl regulier (nbrer_kernel) ;
	    
	    if (l_quant == 0)
		for (int i=0 ; i<cont ; i++)
		    va.c_cf->set(0, k, j, i) = soluce(i) ;
	    else {
		if (l_quant %2 == 0)
		    regulier = regularise (soluce, nbrer_kernel, R_CHEBP) ;
		else
		    regulier = regularise (soluce, nbrer_kernel, R_CHEBI) ;
		
		for (int i=0 ; i<nbrer_kernel ; i++)
		    va.c_cf->set(0, k, j, i) = regulier(i) ;
		}
	    }
    va.ylm_i() ;
}
}