File: comb_lin_cpt.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 (241 lines) | stat: -rw-r--r-- 6,053 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
/*
 *   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 comb_lin_cpt_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/PDE/comb_lin_cpt.C,v 1.4 2014/10/13 08:53:28 j_novak Exp $" ;

/*
 * $Id: comb_lin_cpt.C,v 1.4 2014/10/13 08:53:28 j_novak Exp $
 * $Log: comb_lin_cpt.C,v $
 * Revision 1.4  2014/10/13 08:53:28  j_novak
 * Lorene classes and functions now belong to the namespace Lorene.
 *
 * Revision 1.3  2014/10/06 15:16:08  j_novak
 * Modified #include directives to use c++ syntax.
 *
 * Revision 1.2  2002/10/16 14:37:11  j_novak
 * Reorganization of #include instructions of standard C++, in order to
 * use experimental version 3 of gcc.
 *
 * Revision 1.1.1.1  2001/11/20 15:19:28  e_gourgoulhon
 * LORENE
 *
 * Revision 2.1  2000/11/22  19:29:50  eric
 * Changement de nom_C en comb_lin_cpt_C
 * Nettoyage des includes
 *
 * Revision 2.0  2000/03/16  16:25:18  phil
 * *** empty log message ***
 *
 *
 * $Header: /cvsroot/Lorene/C++/Source/Non_class_members/PDE/comb_lin_cpt.C,v 1.4 2014/10/13 08:53:28 j_novak Exp $
 *
 */

// Headers C
#include <cstdlib>

// Headers Lorene
#include "matrice.h"

/*
 * Gestion des CL permettant de mettre a bande les operateurs associes a poisson 
 * compact. Version pour les sources et les matrices des operateurs.
 */


// Version Matrice --> Matrice
namespace Lorene {
Matrice _cl_cpt_pas_prevu (const Matrice &source, int) {
    cout << "Combinaison lineaire pas prevu..." << endl ;
    cout << "Source : " << source << endl ;
    abort() ;
    return source;
}


		//-------------------
	       //--  R_CHEBP   -----
	      //-------------------


Matrice _cl_cpt_r_chebp (const Matrice &source, int) {
    
    int n = source.get_dim(0) ;
    assert (n == source.get_dim(1)) ;

    Matrice barre(source) ;
    int dirac = 1 ;
    for (int i=0 ; i<n-2 ; i++) {
	for (int j=0 ; j<n ; j++)
	    barre.set(i, j) = ((1+dirac)*source(i, j)-source(i+2, j))/(i+1) ;
	if (i==0) dirac = 0 ;
    }

    Matrice res(barre) ;
    for (int i=0 ; i<n-4 ; i++)
	for (int j=0 ; j<n ; j++)
	    res.set(i, j) = barre(i, j)-barre(i+2, j) ;
    
    res.set_band(4, 1) ;
    res.set_lu() ;
    return res ;
}

		//-------------------
	       //--  R_CHEBI   -----
	      //-------------------


Matrice _cl_cpt_r_chebi (const Matrice &source, int l) {
    int n = source.get_dim(0) ;
    assert (n == source.get_dim(1)) ;
   
    Matrice barre(source) ;
    for (int i=0 ; i<n-2 ; i++)
	for (int j=0 ; j<n ; j++)
	    barre.set(i, j) = (source(i, j)-source(i+1, j))/(i+1) ;
    
    Matrice res(barre) ;
    for (int i=0 ; i<n-4 ; i++)
	for (int j=0 ; j<n ; j++)
	    res.set(i, j) = barre(i, j)-barre(i+2, j) ;
    
    if (l==1)
	res.set_band(3, 0) ;
    else
	res.set_band(3, 1) ;
    res.set_lu() ;
    return res ;
    
}
		

		//-------------------------
	       //- La routine a appeler ---
	      //---------------------------

Matrice combinaison_cpt (const Matrice &source, int l, int base_r) {
    
		// Routines de derivation
    static Matrice (*combinaison_cpt[MAX_BASE])
			(const Matrice &, int) ;
    static int nap = 0 ;

		// Premier appel
    if (nap==0) {
	nap = 1 ;
	for (int i=0 ; i<MAX_BASE ; i++) {
	    combinaison_cpt[i] = _cl_cpt_pas_prevu ;
	}
		// Les routines existantes
	combinaison_cpt[R_CHEBP >> TRA_R] = _cl_cpt_r_chebp ;
	combinaison_cpt[R_CHEBI >> TRA_R] = _cl_cpt_r_chebi ;
    }
    
    Matrice res(combinaison_cpt[base_r](source, l)) ;
    return res ;
}

	    //--------------------------------------------------------------
	    //		    Version Tbl
	    //--------------------------------------------------------------



Tbl _cl_cpt_pas_prevu(const Tbl& tb) {
    cout << "combinaison_nul_pas_prevu " << endl ;
    cout << "tb : " << tb << endl ;
    abort() ;
    return tb ;
}

	
		//-------------------
	       //--  R_CHEBP   -----
	      //-------------------
Tbl _cl_cpt_r_chebp(const Tbl& tb) {
    
    assert (tb.get_etat() != ETATNONDEF) ;
    int n=tb.get_dim(0) ;
    
    Tbl barre(tb) ;
    int dirac = 1 ;
    for (int i=0 ; i<n-2 ; i++) {
	barre.set(i) = ((1+dirac)*tb(i)-tb(i+2))/(i+1) ;
	if (i==0) dirac = 0 ;
    }

    Tbl res(barre) ;
    for (int i=0 ; i<n-4 ; i++)
	res.set(i) = barre(i)-barre(i+2) ;
		
    return res ;
}


	
		//-------------------
	       //--  R_CHEBI   -----
	      //-------------------
Tbl _cl_cpt_r_chebi(const Tbl& tb) {
   
    assert (tb.get_etat() != ETATNONDEF) ;
    int n=tb.get_dim(0) ;
    
    Tbl barre(tb) ;
    for (int i=0 ; i<n-2 ; i++)
	barre.set(i) = (tb(i)-tb(i+1))/(i+1) ;

    Tbl res(barre) ;
    for (int i=0 ; i<n-4 ; i++)
	res.set(i) = barre(i)-barre(i+2) ;
		
    return res ;
}  


		//----------------------------
	       //- Routine a appeler        ---
	      //------------------------------

Tbl combinaison_cpt (const Tbl &source, int base_r) {
    
		// Routines de derivation
    static Tbl (*combinaison_cpt[MAX_BASE])(const Tbl&) ;
    static int nap = 0 ;

		// Premier appel
    if (nap==0) {
	nap = 1 ;
	for (int i=0 ; i<MAX_BASE ; i++) {
	    combinaison_cpt[i] = _cl_cpt_pas_prevu ;
	}
		// Les routines existantes
	combinaison_cpt[R_CHEBP >> TRA_R] = _cl_cpt_r_chebp ;
	combinaison_cpt[R_CHEBI >> TRA_R] = _cl_cpt_r_chebi ;
    }
    
    Tbl res(combinaison_cpt[base_r](source)) ;
    return res ;
}

}