LORENE
multxpun_1d.C
1/*
2 * Copyright (c) 2000-2001 Philippe Grandclement
3 *
4 * This file is part of LORENE.
5 *
6 * LORENE is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * LORENE is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with LORENE; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *
20 */
21
22
23char multxpun_1d_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/multxpun_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $" ;
24
25/*
26 * $Id: multxpun_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $
27 * $Log: multxpun_1d.C,v $
28 * Revision 1.3 2014/10/13 08:53:24 j_novak
29 * Lorene classes and functions now belong to the namespace Lorene.
30 *
31 * Revision 1.2 2014/10/06 15:16:06 j_novak
32 * Modified #include directives to use c++ syntax.
33 *
34 * Revision 1.1 2007/12/11 15:42:22 jl_cornou
35 * Premiere version des fonctions liees aux polynomes de Jacobi(0,2)
36 *
37 * Revision 1.2 2002/10/16 14:37:07 j_novak
38 * Reorganization of #include instructions of standard C++, in order to
39 * use experimental version 3 of gcc.
40 *
41 * Revision 1.1.1.1 2001/11/20 15:19:29 e_gourgoulhon
42 * LORENE
43 *
44 * Revision 2.0 2000/04/03 17:01:59 phil
45 * *** empty log message ***
46 *
47 *
48 * $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/multxpun_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $
49 *
50 */
51
52
53#include <cstdlib>
54#include <cmath>
55
56#include "tbl.h"
57#include "type_parite.h"
58
59/*
60 * Operateur :
61 * -R_JACO02 : (f-f(-1))*(x+1)
62 *
63 *
64 * Entree : coefficients de f dans tb
65 * nr : nombre de points en r
66 *
67 * Sortie : coefficient du resultat dans xo
68 *
69 *
70 */
71
72
73 //-----------------------------------
74 // Routine pour les cas non prevus --
75 //-----------------------------------
76
77namespace Lorene {
78void _multxpun_1d_pas_prevu(int nr, double* tb, double *res) {
79 cout << "multxpun pas prevu..." << endl ;
80 cout << " valeurs: " << tb << " " << res << endl ;
81 cout << "nr : " << nr << endl ;
82 abort () ;
83 exit(-1) ;
84}
85
86 //---------------
87 // cas R_JACO02 -
88 //---------------
89
90void _multxpun_1d_r_jaco02 (int nr, double* tb, double *xo)
91{
92
93 xo[nr-1] = 0 ;
94 for (int i = 1 ; i < nr-1 ; i++) {
95 xo[i] = i*(i+2)/double((i+1)*(2*i+1))*tb[i-1] + (i*i+3*i+3)/double((i+1)*(i+2))*tb[i] + (i+1)*(i+3)/double((i+2)*(2*i+5))*tb[i+1] ;
96 }
97 xo[0] = 1.5*tb[0] + 0.3*tb[1] ;
98 xo[nr-1] = (nr*nr-1)/double((nr)*(2*nr-1))*tb[nr-2] + (1+1/double((nr)*(nr+1)))*tb[nr-1] ;
99}
100
101 //----------------------------
102 // La routine a appeler ----
103 //----------------------------
104
105
106void multxpun_1d(int nr, double **tb, int base_r) // Version appliquee a this
107{
108
109// Routines de derivation
110static void (*multxpun_1d[MAX_BASE])(int, double *, double *) ;
111static int nap = 0 ;
112
113 // Premier appel
114 if (nap==0) {
115 nap = 1 ;
116 for (int i=0 ; i<MAX_BASE ; i++) {
117 multxpun_1d[i] = _multxpun_1d_pas_prevu ;
118 }
119 // Les routines existantes
120 multxpun_1d[R_JACO02 >> TRA_R] = _multxpun_1d_r_jaco02 ;
121 }
122
123 double *result = new double[nr] ;
124 multxpun_1d[base_r](nr, *tb, result) ;
125
126 delete [] (*tb) ;
127 (*tb) = result ;
128}
129}
#define MAX_BASE
Nombre max. de bases differentes.
#define R_JACO02
base de Jacobi(0,2) ordinaire (finjac)
#define TRA_R
Translation en R, used for a bitwise shift (in hex)
Lorene prototypes.
Definition app_hor.h:64