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
|
/*
* 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 sxpun_1d_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/sxpun_1d.C,v 1.8 2014/10/13 08:53:27 j_novak Exp $" ;
/*
* $Id: sxpun_1d.C,v 1.8 2014/10/13 08:53:27 j_novak Exp $
* $Log: sxpun_1d.C,v $
* Revision 1.8 2014/10/13 08:53:27 j_novak
* Lorene classes and functions now belong to the namespace Lorene.
*
* Revision 1.7 2014/10/06 15:16:07 j_novak
* Modified #include directives to use c++ syntax.
*
* Revision 1.6 2008/08/27 08:50:10 jl_cornou
* Added Jacobi(0,2) polynomials
*
* Revision 1.5 2007/12/21 13:59:02 j_novak
* Suppression of call to pow(-1, something).
*
* Revision 1.4 2007/12/12 09:56:57 jl_cornou
* *** empty log message ***
*
* Revision 1.2 2002/10/16 14:37:07 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:29 e_gourgoulhon
* LORENE
*
* Revision 2.0 2000/04/03 17:01:59 phil
* *** empty log message ***
*
*
* $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/sxpun_1d.C,v 1.8 2014/10/13 08:53:27 j_novak Exp $
*
*/
#include <cstdlib>
#include <cmath>
#include "tbl.h"
#include "type_parite.h"
/*
* Operateur :
* -R_CHEB : (f-f(-1))/(x+1)
* -R_JACO02 : (f-f(-1))/(x+1)
*
*
* Entree : coefficients de f dans tb
* nr : nombre de points en r
* Sortie : coefficient du resultat dans tb
*
*
*/
//-----------------------------------
// Routine pour les cas non prevus --
//-----------------------------------
namespace Lorene {
void _sxpun_1d_pas_prevu(int nr, double* tb, double *res) {
cout << "sxpun pas prevu..." << endl ;
cout << " valeurs: " << tb << " " << res << endl ;
cout << "nr : " << nr << endl ;
abort () ;
exit(-1) ;
}
//---------------
// cas R_CHEB ---
//---------------
void _sxpun_1d_r_cheb (int nr, double* tb, double *xo)
{
assert (nr >= 3) ;
xo[nr-1] = 0 ;
xo[nr-2] = 2*(tb[nr-1]-xo[nr-1]) ;
for (int i=nr-3 ; i>0 ; i--)
xo[i] = 2*tb[i+1]-2*xo[i+1]-xo[i+2] ;
double somme = 0 ;
for (int i=0 ; i<nr ; i++)
if (i%2 == 0)
somme += tb[i] ;
else
somme -= tb[i] ;
xo[0] = tb[0]-xo[1]/2.-somme ;
}
//---------------
// cas R_JACO02 -
//---------------
void _sxpun_1d_r_jaco02 (int nr, double* tb, double* xo)
{
xo[nr-1] = 0 ;
double somme ;
for (int i = 0 ; i < nr-1 ; i++) {
somme = 0 ;
for (int j = i+1 ; j < nr ; j++) {
int signe = ((j-1-i)%2 == 0 ? 1 : -1) ;
somme += signe*((j+1)*(j+2)/double((i+1)*(i+2))-(i+1)*(i+2)/double((j+1)*(j+2)))*tb[j] ;
}
xo[i] = (2*i+3)/double(4)*somme ;
}
}
//----------------------------
// La routine a appeler ----
//----------------------------
void sxpun_1d(int nr, double **tb, int base_r) // Version appliquee a this
{
// Routines de derivation
static void (*sxpun_1d[MAX_BASE])(int, double *, double *) ;
static int nap = 0 ;
// Premier appel
if (nap==0) {
nap = 1 ;
for (int i=0 ; i<MAX_BASE ; i++) {
sxpun_1d[i] = _sxpun_1d_pas_prevu ;
}
// Les routines existantes
sxpun_1d[R_CHEB >> TRA_R] = _sxpun_1d_r_cheb ;
sxpun_1d[R_JACO02 >> TRA_R] = _sxpun_1d_r_jaco02 ;
}
double *result = new double[nr] ;
sxpun_1d[base_r](nr, *tb, result) ;
delete [] (*tb) ;
(*tb) = result ;
}
}
|
