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
23
24
25/*
26 * $Id: multxpun_1d.C,v 1.4 2016/12/05 16:18:07 j_novak Exp $
27 * $Log: multxpun_1d.C,v $
28 * Revision 1.4 2016/12/05 16:18:07 j_novak
29 * Suppression of some global variables (file names, loch, ...) to prevent redefinitions
30 *
31 * Revision 1.3 2014/10/13 08:53:24 j_novak
32 * Lorene classes and functions now belong to the namespace Lorene.
33 *
34 * Revision 1.2 2014/10/06 15:16:06 j_novak
35 * Modified #include directives to use c++ syntax.
36 *
37 * Revision 1.1 2007/12/11 15:42:22 jl_cornou
38 * Premiere version des fonctions liees aux polynomes de Jacobi(0,2)
39 *
40 * Revision 1.2 2002/10/16 14:37:07 j_novak
41 * Reorganization of #include instructions of standard C++, in order to
42 * use experimental version 3 of gcc.
43 *
44 * Revision 1.1.1.1 2001/11/20 15:19:29 e_gourgoulhon
45 * LORENE
46 *
47 * Revision 2.0 2000/04/03 17:01:59 phil
48 * *** empty log message ***
49 *
50 *
51 * $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/multxpun_1d.C,v 1.4 2016/12/05 16:18:07 j_novak Exp $
52 *
53 */
54
55
56#include <cstdlib>
57#include <cmath>
58
59#include "tbl.h"
60#include "type_parite.h"
61
62/*
63 * Operateur :
64 * -R_JACO02 : (f-f(-1))*(x+1)
65 *
66 *
67 * Entree : coefficients de f dans tb
68 * nr : nombre de points en r
69 *
70 * Sortie : coefficient du resultat dans xo
71 *
72 *
73 */
74
75
76 //-----------------------------------
77 // Routine pour les cas non prevus --
78 //-----------------------------------
79
80namespace Lorene {
81void _multxpun_1d_pas_prevu(int nr, double* tb, double *res) {
82 cout << "multxpun pas prevu..." << endl ;
83 cout << " valeurs: " << tb << " " << res << endl ;
84 cout << "nr : " << nr << endl ;
85 abort () ;
86 exit(-1) ;
87}
88
89 //---------------
90 // cas R_JACO02 -
91 //---------------
92
93void _multxpun_1d_r_jaco02 (int nr, double* tb, double *xo)
94{
95
96 xo[nr-1] = 0 ;
97 for (int i = 1 ; i < nr-1 ; i++) {
98 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] ;
99 }
100 xo[0] = 1.5*tb[0] + 0.3*tb[1] ;
101 xo[nr-1] = (nr*nr-1)/double((nr)*(2*nr-1))*tb[nr-2] + (1+1/double((nr)*(nr+1)))*tb[nr-1] ;
102}
103
104 //----------------------------
105 // La routine a appeler ----
106 //----------------------------
107
108
109void multxpun_1d(int nr, double **tb, int base_r) // Version appliquee a this
110{
111
112// Routines de derivation
113static void (*multxpun_1d[MAX_BASE])(int, double *, double *) ;
114static int nap = 0 ;
115
116 // Premier appel
117 if (nap==0) {
118 nap = 1 ;
119 for (int i=0 ; i<MAX_BASE ; i++) {
120 multxpun_1d[i] = _multxpun_1d_pas_prevu ;
121 }
122 // Les routines existantes
123 multxpun_1d[R_JACO02 >> TRA_R] = _multxpun_1d_r_jaco02 ;
124 }
125
126 double *result = new double[nr] ;
127 multxpun_1d[base_r](nr, *tb, result) ;
128
129 delete [] (*tb) ;
130 (*tb) = result ;
131}
132}
#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:67