23char d2sdx2_1d_C[] =
"$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/d2sdx2_1d.C,v 1.7 2015/03/05 08:49:31 j_novak Exp $" ;
71#include "type_parite.h"
90void _d2sdx2_1d_pas_prevu(
int nr,
double* tb,
double *xo) {
91 cout <<
"d2sdx2 pas prevu..." << endl ;
92 cout <<
"Nombre de points : " << nr << endl ;
93 cout <<
"Valeurs : " << tb <<
" " << xo <<endl ;
102void _d2sdx2_1d_r_chebu(
int nr,
double* tb,
double *xo)
105 static double* cx1 = 0x0 ;
106 static double* cx2 = 0x0 ;
107 static double* cx3 = 0x0 ;
108 static int nr_pre = 0 ;
113 if (cx1 != 0x0)
delete [] cx1 ;
114 if (cx2 != 0x0)
delete [] cx2 ;
115 if (cx3 != 0x0)
delete [] cx3 ;
116 cx1 =
new double [nr] ;
117 cx2 =
new double [nr] ;
118 cx3 =
new double [nr] ;
119 for (
int i=0 ; i<nr ; i++) {
120 cx1[i] = (i+2)*(i+2)*(i+2) ;
129 som1 = (nr-1)*(nr-1)*(nr-1) * tb[nr-1] ;
130 som2 = (nr-1) * tb[nr-1] ;
131 xo[nr-3] = som1 - (nr-3)*(nr-3)*som2 ;
132 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
133 som1 += cx1[i] * tb[i+2] ;
134 som2 += cx2[i] * tb[i+2] ;
135 xo[i] = som1 - cx3[i] * som2 ;
139 som1 = (nr-2)*(nr-2)*(nr-2) * tb[nr-2] ;
140 som2 = (nr-2) * tb[nr-2] ;
141 xo[nr-4] = som1 - (nr-4)*(nr-4)*som2 ;
142 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
143 som1 += cx1[i] * tb[i+2] ;
144 som2 += cx2[i] * tb[i+2] ;
145 xo[i] = som1 - cx3[i] * som2 ;
155void _d2sdx2_1d_r_cheb(
int nr,
double* tb,
double *xo)
159 static double* cx1 = 0x0 ;
160 static double* cx2 = 0x0 ;
161 static double* cx3 = 0x0 ;
162 static int nr_pre = 0 ;
167 if (cx1 != 0x0)
delete [] cx1 ;
168 if (cx2 != 0x0)
delete [] cx2 ;
169 if (cx3 != 0x0)
delete [] cx3 ;
170 cx1 =
new double [nr] ;
171 cx2 =
new double [nr] ;
172 cx3 =
new double [nr] ;
173 for (
int i=0 ; i<nr ; i++) {
174 cx1[i] = (i+2)*(i+2)*(i+2) ;
183 som1 = (nr-1)*(nr-1)*(nr-1) * tb[nr-1] ;
184 som2 = (nr-1) * tb[nr-1] ;
185 xo[nr-3] = som1 - (nr-3)*(nr-3)*som2 ;
186 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
187 som1 += cx1[i] * tb[i+2] ;
188 som2 += cx2[i] * tb[i+2] ;
189 xo[i] = som1 - cx3[i] * som2 ;
192 som1 = (nr-2)*(nr-2)*(nr-2) * tb[nr-2] ;
193 som2 = (nr-2) * tb[nr-2] ;
194 xo[nr-4] = som1 - (nr-4)*(nr-4)*som2 ;
195 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
196 som1 += cx1[i] * tb[i+2] ;
197 som2 += cx2[i] * tb[i+2] ;
198 xo[i] = som1 - cx3[i] * som2 ;
208void _d2sdx2_1d_r_jaco02(
int nr,
double* tb,
double *xo)
212 for (
int i = 0 ; i<nr ; i++) {
222void _d2sdx2_1d_r_chebp(
int nr,
double* tb,
double *xo)
225 static double* cx1 = 0x0 ;
226 static double* cx2 = 0x0 ;
227 static double* cx3 = 0x0 ;
228 static int nr_pre = 0 ;
233 if (cx1 != 0x0)
delete [] cx1 ;
234 if (cx2 != 0x0)
delete [] cx2 ;
235 if (cx3 != 0x0)
delete [] cx3 ;
236 cx1 =
new double [nr] ;
237 cx2 =
new double [nr] ;
238 cx3 =
new double [nr] ;
239 for (
int i=0 ; i<nr ; i++) {
240 cx1[i] = 8*(i+1)*(i+1)*(i+1) ;
249 som1 = 8*(nr-1)*(nr-1)*(nr-1) * tb[nr-1] ;
250 som2 = 2*(nr-1) * tb[nr-1] ;
251 xo[nr-2] = som1 - 4*(nr-2)*(nr-2)*som2 ;
253 for (
int i = nr-3 ; i >= 0 ; i-- ) {
254 som1 += cx1[i] * tb[i+1] ;
255 som2 += cx2[i] * tb[i+1] ;
256 xo[i] = som1 - cx3[i] * som2 ;
265void _d2sdx2_1d_r_chebi(
int nr,
double* tb,
double *xo)
268 static double* cx1 = 0x0 ;
269 static double* cx2 = 0x0 ;
270 static double* cx3 = 0x0 ;
271 static int nr_pre = 0 ;
277 if (cx1 != 0x0)
delete [] cx1 ;
278 if (cx2 != 0x0)
delete [] cx2 ;
279 if (cx3 != 0x0)
delete [] cx3 ;
280 cx1 =
new double [nr] ;
281 cx2 =
new double [nr] ;
282 cx3 =
new double [nr] ;
283 for (
int i=0 ; i<nr ; i++) {
284 cx1[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
286 cx3[i] = (2*i+1)*(2*i+1) ;
294 som1 = (2*nr-1)*(2*nr-1)*(2*nr-1) * tb[nr-1] ;
295 som2 = (2*nr-1) * tb[nr-1] ;
296 xo[nr-2] = som1 - (2*nr-3)*(2*nr-3)*som2 ;
297 for (
int i = nr-3 ; i >= 0 ; i-- ) {
298 som1 += cx1[i] * tb[i+1] ;
299 som2 += cx2[i] * tb[i+1] ;
300 xo[i] = som1 - cx3[i] * som2 ;
309void _d2sdx2_1d_r_leg(
int nr,
double* tb,
double *xo)
313 static double* cx1 = 0x0 ;
314 static double* cx2 = 0x0 ;
315 static double* cx3 = 0x0 ;
316 static int nr_pre = 0 ;
321 if (cx1 != 0x0)
delete [] cx1 ;
322 if (cx2 != 0x0)
delete [] cx2 ;
323 if (cx3 != 0x0)
delete [] cx3 ;
324 cx1 =
new double [nr] ;
325 cx2 =
new double [nr] ;
326 cx3 =
new double [nr] ;
327 for (
int i=0 ; i<nr ; i++) {
328 cx1[i] = (i+2)*(i+3) ;
330 cx3[i] = double(i) + 0.5 ;
337 som1 = (nr-1)* nr * tb[nr-1] ;
340 xo[nr-3] = (double(nr) - 2.5) * (som1 - (nr-3)*(nr-2)*som2) ;
341 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
342 som1 += cx1[i] * tb[i+2] ;
344 xo[i] = cx3[i]*(som1 - cx2[i] * som2) ;
346 if (nr > 1) xo[nr-2] = 0 ;
348 som1 = (nr-2)*(nr-1) * tb[nr-2] ;
350 xo[nr-4] = (double(nr) - 3.5) * (som1 - (nr-4)*(nr-3)*som2) ;
352 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
353 som1 += cx1[i] * tb[i+2] ;
355 xo[i] = cx3[i]*(som1 - cx2[i] * som2) ;
364void _d2sdx2_1d_r_legp(
int nr,
double* tb,
double *xo)
367 static double* cx1 = 0x0 ;
368 static double* cx2 = 0x0 ;
369 static double* cx3 = 0x0 ;
370 static int nr_pre = 0 ;
375 if (cx1 != 0x0)
delete [] cx1 ;
376 if (cx2 != 0x0)
delete [] cx2 ;
377 if (cx3 != 0x0)
delete [] cx3 ;
378 cx1 =
new double [nr] ;
379 cx2 =
new double [nr] ;
380 cx3 =
new double [nr] ;
381 for (
int i=0 ; i<nr ; i++) {
382 cx1[i] = (2*i+2)*(2*i+3) ;
383 cx2[i] = 2*i*2*(i+1) ;
384 cx3[i] = double(2*i)+ 0.5 ;
391 som1 = (2*nr-2)*(2*nr-1)* tb[nr-1] ;
394 xo[nr-2] = (double(2*nr) - 1.5)*(som1 - 2*(nr-2)*(2*nr-1)*som2) ;
395 for (
int i = nr-3 ; i >= 0 ; i-- ) {
396 som1 += cx1[i] * tb[i+1] ;
398 xo[i] = cx3[i]*(som1 - cx2[i]*som2) ;
406void _d2sdx2_1d_r_legi(
int nr,
double* tb,
double *xo)
409 static double* cx1 = 0x0 ;
410 static double* cx2 = 0x0 ;
411 static double* cx3 = 0x0 ;
412 static int nr_pre = 0 ;
418 if (cx1 != 0x0)
delete [] cx1 ;
419 if (cx2 != 0x0)
delete [] cx2 ;
420 if (cx3 != 0x0)
delete [] cx3 ;
421 cx1 =
new double [nr] ;
422 cx2 =
new double [nr] ;
423 cx3 =
new double [nr] ;
424 for (
int i=0 ; i<nr ; i++) {
425 cx1[i] = (2*i+3)*(2*i+4) ;
426 cx2[i] = (2*i+1)*(2*i+2) ;
427 cx3[i] = double(2*i) + 1.5 ;
435 som1 = (2*nr-1)*(2*nr) * tb[nr-1] ;
438 xo[nr-2] = (double(nr) - 1.5)*(som1 - (2*nr-3)*(2*nr-2)*som2) ;
439 for (
int i = nr-3 ; i >= 0 ; i-- ) {
440 som1 += cx1[i] * tb[i+1] ;
442 xo[i] = cx3[i]*(som1 - cx2[i] * som2) ;
452void d2sdx2_1d(
int nr,
double** tb,
int base_r)
456 static void (*d2sdx2_1d[
MAX_BASE])(int,
double*,
double *) ;
463 d2sdx2_1d[i] = _d2sdx2_1d_pas_prevu ;
470 d2sdx2_1d[
R_LEG >>
TRA_R] = _d2sdx2_1d_r_leg ;
476 double *result =
new double[nr] ;
478 d2sdx2_1d[base_r](nr, *tb, result) ;
#define R_LEGP
base de Legendre paire (rare) seulement
#define MAX_BASE
Nombre max. de bases differentes.
#define R_CHEBU
base de Chebychev ordinaire (fin), dev. en 1/r
#define R_JACO02
base de Jacobi(0,2) ordinaire (finjac)
#define R_LEGI
base de Legendre impaire (rare) seulement
#define R_CHEBI
base de Cheb. impaire (rare) seulement
#define R_LEG
base de Legendre ordinaire (fin)
#define TRA_R
Translation en R, used for a bitwise shift (in hex)
#define R_CHEB
base de Chebychev ordinaire (fin)
#define R_CHEBP
base de Cheb. paire (rare) seulement