25char op_d2sdx2_C[] =
"$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/op_d2sdx2.C,v 1.7 2015/03/05 08:49:32 j_novak Exp $" ;
93void _d2sdx2_1d_r_jaco02(
int,
double*,
double*) ;
100void _d2sdx2_pas_prevu(Tbl* ,
int & b) {
101 cout <<
"d2sdx2 pas prevu..." << endl ;
102 cout <<
" base: " << b << endl ;
108void _d2sdx2_r_chebu_0(Tbl *tb,
int & )
112 if (tb->get_etat() == ETATZERO) {
117 assert(tb->get_etat() == ETATQCQ) ;
120 int nr = (tb->dim).dim[0] ;
121 int nt = (tb->dim).dim[1] ;
122 int np = (tb->dim).dim[2] ;
126 static double* cx1 = 0x0 ;
127 static double* cx2 = 0x0 ;
128 static double* cx3 = 0x0 ;
129 static int nr_pre = 0 ;
134 if (cx1 != 0x0)
delete [] cx1 ;
135 if (cx2 != 0x0)
delete [] cx2 ;
136 if (cx3 != 0x0)
delete [] cx3 ;
137 cx1 =
new double [nr] ;
138 cx2 =
new double [nr] ;
139 cx3 =
new double [nr] ;
140 for (
int i=0 ; i<nr ; i++) {
141 cx1[i] = (i+2)*(i+2)*(i+2) ;
148 double* xo =
new double[(tb->dim).taille] ;
151 for (
int i=0; i<(tb->dim).taille; i++) {
160 for (
int k=0 ; k<np+1 ; k++)
166 for (
int j=0 ; j<nt ; j++) {
171 som1 = (nr-1)*(nr-1)*(nr-1) * xci[nr-1] ;
172 som2 = (nr-1) * xci[nr-1] ;
173 xco[nr-3] = som1 - (nr-3)*(nr-3)*som2 ;
174 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
175 som1 += cx1[i] * xci[i+2] ;
176 som2 += cx2[i] * xci[i+2] ;
177 xco[i] = som1 - cx3[i] * som2 ;
180 som1 = (nr-2)*(nr-2)*(nr-2) * xci[nr-2] ;
181 som2 = (nr-2) * xci[nr-2] ;
182 xco[nr-4] = som1 - (nr-4)*(nr-4)*som2 ;
183 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
184 som1 += cx1[i] * xci[i+2] ;
185 som2 += cx2[i] * xci[i+2] ;
186 xco[i] = som1 - cx3[i] * som2 ;
205void _d2sdx2_r_cheb(Tbl *tb,
int & )
209 if (tb->get_etat() == ETATZERO) {
214 assert(tb->get_etat() == ETATQCQ) ;
217 int nr = (tb->dim).dim[0] ;
218 int nt = (tb->dim).dim[1] ;
219 int np = (tb->dim).dim[2] ;
223 static double* cx1 = 0x0 ;
224 static double* cx2 = 0x0 ;
225 static double* cx3 = 0x0 ;
226 static int nr_pre = 0 ;
231 if (cx1 != 0x0)
delete [] cx1 ;
232 if (cx2 != 0x0)
delete [] cx2 ;
233 if (cx3 != 0x0)
delete [] cx3 ;
234 cx1 =
new double [nr] ;
235 cx2 =
new double [nr] ;
236 cx3 =
new double [nr] ;
238 for (
int i=0 ; i<nr ; i++) {
239 cx1[i] = (i+2)*(i+2)*(i+2) ;
246 double* xo =
new double[(tb->dim).taille] ;
249 for (
int i=0; i<(tb->dim).taille; i++) {
258 for (
int k=0 ; k<np+1 ; k++)
264 for (
int j=0 ; j<nt ; j++) {
269 som1 = (nr-1)*(nr-1)*(nr-1) * xci[nr-1] ;
270 som2 = (nr-1) * xci[nr-1] ;
271 xco[nr-3] = som1 - (nr-3)*(nr-3)*som2 ;
272 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
273 som1 += cx1[i] * xci[i+2] ;
274 som2 += cx2[i] * xci[i+2] ;
275 xco[i] = som1 - cx3[i] * som2 ;
278 som1 = (nr-2)*(nr-2)*(nr-2) * xci[nr-2] ;
279 som2 = (nr-2) * xci[nr-2] ;
280 xco[nr-4] = som1 - (nr-4)*(nr-4)*som2 ;
281 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
282 som1 += cx1[i] * xci[i+2] ;
283 som2 += cx2[i] * xci[i+2] ;
284 xco[i] = som1 - cx3[i] * som2 ;
303void _d2sdx2_r_chebp(Tbl *tb,
int & )
307 if (tb->get_etat() == ETATZERO) {
312 assert(tb->get_etat() == ETATQCQ) ;
315 int nr = (tb->dim).dim[0] ;
316 int nt = (tb->dim).dim[1] ;
317 int np = (tb->dim).dim[2] ;
321 static double* cx1 = 0x0 ;
322 static double* cx2 = 0x0 ;
323 static double* cx3 = 0x0 ;
324 static int nr_pre = 0 ;
329 if (cx1 != 0x0)
delete [] cx1 ;
330 if (cx2 != 0x0)
delete [] cx2 ;
331 if (cx3 != 0x0)
delete [] cx3 ;
332 cx1 =
new double [nr] ;
333 cx2 =
new double [nr] ;
334 cx3 =
new double [nr] ;
335 for (
int i=0 ; i<nr ; i++) {
336 cx1[i] = 8*(i+1)*(i+1)*(i+1) ;
342 double* xo =
new double[(tb->dim).taille] ;
345 for (
int i=0; i<(tb->dim).taille; i++) {
354 for (
int k=0 ; k<np+1 ; k++)
360 for (
int j=0 ; j<nt ; j++) {
365 som1 = 8*(nr-1)*(nr-1)*(nr-1) * xci[nr-1] ;
366 som2 = 2*(nr-1) * xci[nr-1] ;
367 xco[nr-2] = som1 - 4*(nr-2)*(nr-2)*som2 ;
368 for (
int i = nr-3 ; i >= 0 ; i-- ) {
369 som1 += cx1[i] * xci[i+1] ;
370 som2 += cx2[i] * xci[i+1] ;
371 xco[i] = som1 - cx3[i] * som2 ;
390void _d2sdx2_r_chebi(Tbl *tb,
int & )
394 if (tb->get_etat() == ETATZERO) {
399 assert(tb->get_etat() == ETATQCQ) ;
402 int nr = (tb->dim).dim[0] ;
403 int nt = (tb->dim).dim[1] ;
404 int np = (tb->dim).dim[2] ;
408 static double* cx1 = 0x0 ;
409 static double* cx2 = 0x0 ;
410 static double* cx3 = 0x0 ;
411 static int nr_pre = 0 ;
416 if (cx1 != 0x0)
delete [] cx1 ;
417 if (cx2 != 0x0)
delete [] cx2 ;
418 if (cx3 != 0x0)
delete [] cx3 ;
419 cx1 =
new double [nr] ;
420 cx2 =
new double [nr] ;
421 cx3 =
new double [nr] ;
423 for (
int i=0 ; i<nr ; i++) {
424 cx1[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
426 cx3[i] = (2*i+1)*(2*i+1) ;
431 double* xo =
new double[(tb->dim).taille] ;
434 for (
int i=0; i<(tb->dim).taille; i++) {
443 for (
int k=0 ; k<np+1 ; k++)
449 for (
int j=0 ; j<nt ; j++) {
454 som1 = (2*nr-1)*(2*nr-1)*(2*nr-1) * xci[nr-1] ;
455 som2 = (2*nr-1) * xci[nr-1] ;
456 xco[nr-2] = som1 - (2*nr-3)*(2*nr-3)*som2 ;
457 for (
int i = nr-3 ; i >= 0 ; i-- ) {
458 som1 += cx1[i] * xci[i+1] ;
459 som2 += cx2[i] * xci[i+1] ;
460 xco[i] = som1 - cx3[i] * som2 ;
478void _d2sdx2_r_chebpim_p(Tbl *tb,
int & )
482 if (tb->get_etat() == ETATZERO) {
487 assert(tb->get_etat() == ETATQCQ) ;
490 int nr = (tb->dim).dim[0] ;
491 int nt = (tb->dim).dim[1] ;
492 int np = (tb->dim).dim[2] ;
496 static double* cx1p = 0x0 ;
497 static double* cx2p = 0x0 ;
498 static double* cx3p = 0x0 ;
499 static double* cx1i = 0x0 ;
500 static double* cx2i = 0x0 ;
501 static double* cx3i = 0x0 ;
502 static int nr_pre = 0 ;
507 if (cx1p != 0x0)
delete [] cx1p ;
508 if (cx2p != 0x0)
delete [] cx2p ;
509 if (cx3p != 0x0)
delete [] cx3p ;
510 if (cx1i != 0x0)
delete [] cx1i ;
511 if (cx2i != 0x0)
delete [] cx2i ;
512 if (cx3i != 0x0)
delete [] cx3i ;
513 cx1p =
new double[nr] ;
514 cx2p =
new double[nr] ;
515 cx3p =
new double[nr] ;
516 cx1i =
new double[nr] ;
517 cx2i =
new double[nr] ;
518 cx3i =
new double[nr] ;
519 for (
int i=0 ; i<nr ; i++) {
520 cx1p[i] = 8*(i+1)*(i+1)*(i+1) ;
524 cx1i[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
526 cx3i[i] = (2*i+1)*(2*i+1) ;
533 cx1t[0] = cx1p ; cx1t[1] = cx1i ;
534 cx2t[0] = cx2p ; cx2t[1] = cx2i ;
535 cx3t[0] = cx3p ; cx3t[1] = cx3i ;
538 double* xo =
new double[(tb->dim).taille] ;
541 for (
int i=0; i<(tb->dim).taille; i++) {
554 double *cx1, *cx2, *cx3 ;
560 for (
int j=0 ; j<nt ; j++) {
566 for (
int i = nr-2 ; i >= 0 ; i-- ) {
567 som1 += cx1[i] * xci[i+1] ;
568 som2 += cx2[i] * xci[i+1] ;
569 xco[i] = som1 - cx3[i] * som2 ;
581 for (
int k=2 ; k<np+1 ; k++) {
586 for (
int j=0 ; j<nt ; j++) {
592 for (
int i = nr-2 ; i >= 0 ; i-- ) {
593 som1 += cx1[i] * xci[i+1] ;
594 som2 += cx2[i] * xci[i+1] ;
595 xco[i] = som1 - cx3[i] * som2 ;
597 if (m == 0) xco[0] *= .5 ;
613void _d2sdx2_r_chebpim_i(Tbl *tb,
int & )
617 if (tb->get_etat() == ETATZERO) {
622 assert(tb->get_etat() == ETATQCQ) ;
625 int nr = (tb->dim).dim[0] ;
626 int nt = (tb->dim).dim[1] ;
627 int np = (tb->dim).dim[2] ;
631 static double* cx1p = 0x0 ;
632 static double* cx2p = 0x0 ;
633 static double* cx3p = 0x0 ;
634 static double* cx1i = 0x0 ;
635 static double* cx2i = 0x0 ;
636 static double* cx3i = 0x0 ;
637 static int nr_pre = 0 ;
642 if (cx1p != 0x0)
delete [] cx1p ;
643 if (cx2p != 0x0)
delete [] cx2p ;
644 if (cx3p != 0x0)
delete [] cx3p ;
645 if (cx1i != 0x0)
delete [] cx1i ;
646 if (cx2i != 0x0)
delete [] cx2i ;
647 if (cx3i != 0x0)
delete [] cx3i ;
648 cx1p =
new double[nr] ;
649 cx2p =
new double[nr] ;
650 cx3p =
new double[nr] ;
651 cx1i =
new double[nr] ;
652 cx2i =
new double[nr] ;
653 cx3i =
new double[nr] ;
654 for (
int i=0 ; i<nr ; i++) {
655 cx1p[i] = 8*(i+1)*(i+1)*(i+1) ;
659 cx1i[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
661 cx3i[i] = (2*i+1)*(2*i+1) ;
668 cx1t[1] = cx1p ; cx1t[0] = cx1i ;
669 cx2t[1] = cx2p ; cx2t[0] = cx2i ;
670 cx3t[1] = cx3p ; cx3t[0] = cx3i ;
673 double* xo =
new double[(tb->dim).taille] ;
676 for (
int i=0; i<(tb->dim).taille; i++) {
689 double *cx1, *cx2, *cx3 ;
695 for (
int j=0 ; j<nt ; j++) {
701 for (
int i = nr-2 ; i >= 0 ; i-- ) {
702 som1 += cx1[i] * xci[i+1] ;
703 som2 += cx2[i] * xci[i+1] ;
704 xco[i] = som1 - cx3[i] * som2 ;
715 for (
int k=2 ; k<np+1 ; k++) {
720 for (
int j=0 ; j<nt ; j++) {
726 for (
int i = nr-2 ; i >= 0 ; i-- ) {
727 som1 += cx1[i] * xci[i+1] ;
728 som2 += cx2[i] * xci[i+1] ;
729 xco[i] = som1 - cx3[i] * som2 ;
731 if (m == 1) xco[0] *= .5 ;
747void _d2sdx2_r_chebpi_p(Tbl *tb,
int & )
751 if (tb->get_etat() == ETATZERO) {
756 assert(tb->get_etat() == ETATQCQ) ;
759 int nr = (tb->dim).dim[0] ;
760 int nt = (tb->dim).dim[1] ;
761 int np = (tb->dim).dim[2] ;
765 static double* cx1p = 0x0 ;
766 static double* cx2p = 0x0 ;
767 static double* cx3p = 0x0 ;
768 static double* cx1i = 0x0 ;
769 static double* cx2i = 0x0 ;
770 static double* cx3i = 0x0 ;
771 static int nr_pre = 0 ;
776 if (cx1p != 0x0)
delete [] cx1p ;
777 if (cx2p != 0x0)
delete [] cx2p ;
778 if (cx3p != 0x0)
delete [] cx3p ;
779 if (cx1i != 0x0)
delete [] cx1i ;
780 if (cx2i != 0x0)
delete [] cx2i ;
781 if (cx3i != 0x0)
delete [] cx3i ;
782 cx1p =
new double[nr] ;
783 cx2p =
new double[nr] ;
784 cx3p =
new double[nr] ;
785 cx1i =
new double[nr] ;
786 cx2i =
new double[nr] ;
787 cx3i =
new double[nr] ;
788 for (
int i=0 ; i<nr ; i++) {
789 cx1p[i] = 8*(i+1)*(i+1)*(i+1) ;
793 cx1i[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
795 cx3i[i] = (2*i+1)*(2*i+1) ;
802 cx1t[0] = cx1p ; cx1t[1] = cx1i ;
803 cx2t[0] = cx2p ; cx2t[1] = cx2i ;
804 cx3t[0] = cx3p ; cx3t[1] = cx3i ;
807 double* xo =
new double[(tb->dim).taille] ;
810 for (
int i=0; i<(tb->dim).taille; i++) {
823 double *cx1, *cx2, *cx3 ;
826 for (
int j=0 ; j<nt ; j++) {
835 for (
int i = nr-2 ; i >= 0 ; i-- ) {
836 som1 += cx1[i] * xci[i+1] ;
837 som2 += cx2[i] * xci[i+1] ;
838 xco[i] = som1 - cx3[i] * som2 ;
840 if (l == 0) xco[0] *= .5 ;
850 for (
int k=2 ; k<np+1 ; k++) {
851 for (
int j=0 ; j<nt ; j++) {
860 for (
int i = nr-2 ; i >= 0 ; i-- ) {
861 som1 += cx1[i] * xci[i+1] ;
862 som2 += cx2[i] * xci[i+1] ;
863 xco[i] = som1 - cx3[i] * som2 ;
865 if (l == 0) xco[0] *= .5 ;
881void _d2sdx2_r_chebpi_i(Tbl *tb,
int & )
885 if (tb->get_etat() == ETATZERO) {
890 assert(tb->get_etat() == ETATQCQ) ;
893 int nr = (tb->dim).dim[0] ;
894 int nt = (tb->dim).dim[1] ;
895 int np = (tb->dim).dim[2] ;
899 static double* cx1p = 0x0 ;
900 static double* cx2p = 0x0 ;
901 static double* cx3p = 0x0 ;
902 static double* cx1i = 0x0 ;
903 static double* cx2i = 0x0 ;
904 static double* cx3i = 0x0 ;
905 static int nr_pre = 0 ;
910 if (cx1p != 0x0)
delete [] cx1p ;
911 if (cx2p != 0x0)
delete [] cx2p ;
912 if (cx3p != 0x0)
delete [] cx3p ;
913 if (cx1i != 0x0)
delete [] cx1i ;
914 if (cx2i != 0x0)
delete [] cx2i ;
915 if (cx3i != 0x0)
delete [] cx3i ;
916 cx1p =
new double[nr] ;
917 cx2p =
new double[nr] ;
918 cx3p =
new double[nr] ;
919 cx1i =
new double[nr] ;
920 cx2i =
new double[nr] ;
921 cx3i =
new double[nr] ;
922 for (
int i=0 ; i<nr ; i++) {
923 cx1p[i] = 8*(i+1)*(i+1)*(i+1) ;
927 cx1i[i] = (2*i+3)*(2*i+3)*(2*i+3) ;
929 cx3i[i] = (2*i+1)*(2*i+1) ;
936 cx1t[1] = cx1p ; cx1t[0] = cx1i ;
937 cx2t[1] = cx2p ; cx2t[0] = cx2i ;
938 cx3t[1] = cx3p ; cx3t[0] = cx3i ;
941 double* xo =
new double[(tb->dim).taille] ;
944 for (
int i=0; i<(tb->dim).taille; i++) {
957 double *cx1, *cx2, *cx3 ;
960 for (
int j=0 ; j<nt ; j++) {
969 for (
int i = nr-2 ; i >= 0 ; i-- ) {
970 som1 += cx1[i] * xci[i+1] ;
971 som2 += cx2[i] * xci[i+1] ;
972 xco[i] = som1 - cx3[i] * som2 ;
974 if (l == 1) xco[0] *= .5 ;
984 for (
int k=2 ; k<np+1 ; k++) {
985 for (
int j=0 ; j<nt ; j++) {
994 for (
int i = nr-2 ; i >= 0 ; i-- ) {
995 som1 += cx1[i] * xci[i+1] ;
996 som2 += cx2[i] * xci[i+1] ;
997 xco[i] = som1 - cx3[i] * som2 ;
999 if (l == 1) xco[0] *= .5 ;
1016void _d2sdx2_r_leg(Tbl *tb,
int & )
1020 if (tb->get_etat() == ETATZERO) {
1025 assert(tb->get_etat() == ETATQCQ) ;
1028 int nr = (tb->dim).dim[0] ;
1029 int nt = (tb->dim).dim[1] ;
1030 int np = (tb->dim).dim[2] ;
1034 static double* cx1 = 0x0 ;
1035 static double* cx2 = 0x0 ;
1036 static double* cx3 = 0x0 ;
1037 static int nr_pre = 0 ;
1042 if (cx1 != 0x0)
delete [] cx1 ;
1043 if (cx2 != 0x0)
delete [] cx2 ;
1044 if (cx3 != 0x0)
delete [] cx3 ;
1045 cx1 =
new double [nr] ;
1046 cx2 =
new double [nr] ;
1047 cx3 =
new double [nr] ;
1049 for (
int i=0 ; i<nr ; i++) {
1050 cx1[i] = (i+2)*(i+3) ;
1052 cx3[i] = double(i) + 0.5 ;
1057 double* xo =
new double[(tb->dim).taille] ;
1060 for (
int i=0; i<(tb->dim).taille; i++) {
1065 double* xi = tb->t ;
1069 for (
int k=0 ; k<np+1 ; k++)
1075 for (
int j=0 ; j<nt ; j++) {
1080 som1 = (nr-1)*nr * xci[nr-1] ;
1083 xco[nr-3] = (double(nr) -2.5) * (som1 - (nr-3)*(nr-2)*som2) ;
1084 for (
int i = nr-5 ; i >= 0 ; i -= 2 ) {
1085 som1 += cx1[i] * xci[i+2] ;
1087 xco[i] = cx3[i]*(som1 - cx2[i] * som2) ;
1089 if (nr > 1) xco[nr-2] = 0 ;
1091 som1 = (nr-2)*(nr-1)* xci[nr-2] ;
1093 xco[nr-4] = (double(nr) - 3.5) * (som1 - (nr-4)*(nr-3)*som2) ;
1095 for (
int i = nr-6 ; i >= 0 ; i -= 2 ) {
1096 som1 += cx1[i] * xci[i+2] ;
1098 xco[i] = cx3[i]*(som1 - cx2[i] * som2) ;
1116void _d2sdx2_r_legp(Tbl *tb,
int & )
1120 if (tb->get_etat() == ETATZERO) {
1125 assert(tb->get_etat() == ETATQCQ) ;
1128 int nr = (tb->dim).dim[0] ;
1129 int nt = (tb->dim).dim[1] ;
1130 int np = (tb->dim).dim[2] ;
1134 static double* cx1 = 0x0 ;
1135 static double* cx2 = 0x0 ;
1136 static double* cx3 = 0x0 ;
1137 static int nr_pre = 0 ;
1142 if (cx1 != 0x0)
delete [] cx1 ;
1143 if (cx2 != 0x0)
delete [] cx2 ;
1144 if (cx3 != 0x0)
delete [] cx3 ;
1145 cx1 =
new double [nr] ;
1146 cx2 =
new double [nr] ;
1147 cx3 =
new double [nr] ;
1148 for (
int i=0 ; i<nr ; i++) {
1149 cx1[i] = (2*i+2)*(2*i+3) ;
1150 cx2[i] = 2*i*(2*i+1) ;
1151 cx3[i] = double(2*i) + 0.5 ;
1155 double* xo =
new double[(tb->dim).taille] ;
1158 for (
int i=0; i<(tb->dim).taille; i++) {
1163 double* xi = tb->t ;
1167 for (
int k=0 ; k<np+1 ; k++)
1173 for (
int j=0 ; j<nt ; j++) {
1178 som1 = (2*nr-2)*(2*nr-1)* xci[nr-1] ;
1181 xco[nr-2] = (double(2*nr) - 1.5)*(som1 - 2*(nr-2)*(2*nr-1)*som2) ;
1182 for (
int i = nr-3 ; i >= 0 ; i-- ) {
1183 som1 += cx1[i] * xci[i+1] ;
1185 xco[i] = cx3[i]*(som1 - cx2[i] * som2) ;
1203void _d2sdx2_r_legi(Tbl *tb,
int & )
1207 if (tb->get_etat() == ETATZERO) {
1212 assert(tb->get_etat() == ETATQCQ) ;
1215 int nr = (tb->dim).dim[0] ;
1216 int nt = (tb->dim).dim[1] ;
1217 int np = (tb->dim).dim[2] ;
1221 static double* cx1 = 0x0 ;
1222 static double* cx2 = 0x0 ;
1223 static double* cx3 = 0x0 ;
1224 static int nr_pre = 0 ;
1229 if (cx1 != 0x0)
delete [] cx1 ;
1230 if (cx2 != 0x0)
delete [] cx2 ;
1231 if (cx3 != 0x0)
delete [] cx3 ;
1232 cx1 =
new double [nr] ;
1233 cx2 =
new double [nr] ;
1234 cx3 =
new double [nr] ;
1236 for (
int i=0 ; i<nr ; i++) {
1237 cx1[i] = (2*i+3)*(2*i+4) ;
1238 cx2[i] = (2*i+1)*(2*i+2) ;
1239 cx3[i] = double(2*i) + 1.5 ;
1244 double* xo =
new double[(tb->dim).taille] ;
1247 for (
int i=0; i<(tb->dim).taille; i++) {
1252 double* xi = tb->t ;
1256 for (
int k=0 ; k<np+1 ; k++)
1262 for (
int j=0 ; j<nt ; j++) {
1267 som1 = (2*nr-1)*(2*nr) * xci[nr-1] ;
1270 xco[nr-2] = (double(nr) - 1.5)*(som1 - (2*nr-3)*(2*nr-2)*som2) ;
1271 for (
int i = nr-3 ; i >= 0 ; i-- ) {
1272 som1 += cx1[i] * xci[i+1] ;
1274 xco[i] = cx3[i]*(som1 - cx2[i] * som2) ;
1294void _d2sdx2_r_jaco02(Tbl *tb,
int & )
1298 if (tb->get_etat() == ETATZERO) {
1303 assert(tb->get_etat() == ETATQCQ) ;
1306 int nr = (tb->dim).dim[0] ;
1307 int nt = (tb->dim).dim[1] ;
1308 int np = (tb->dim).dim[2] ;
1312 double* xo =
new double[(tb->dim).taille] ;
1315 for (
int i=0; i<(tb->dim).taille; i++) {
1320 double* xi = tb->t ;
1324 for (
int k=0 ; k<np+1 ; k++)
1330 for (
int j=0 ; j<nt ; j++) {
1332 double* tb1 =
new double[nr] ;
1333 for (
int m =0 ; m<nr ; m++) {
1336 double* res =
new double[nr] ;
1337 _d2sdx2_1d_r_jaco02(nr,tb1,res) ;
1338 for (
int i = 0 ; i<nr ; i++ ) {
void c_est_pas_fait(const char *)
Helpful function to say something is not implemented yet.