LORENE
ope_sec_order_r2_cl.C
1/*
2 * Copyright (c) 2003 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 version 2
8 * as published by the Free Software Foundation.
9 *
10 * LORENE is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with LORENE; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18 *
19 */
20
21char ope_sec_order_r2_cl_C[] = "$Header: /cvsroot/Lorene/C++/Source/Ope_elementary/Ope_sec_order_r2/ope_sec_order_r2_cl.C,v 1.3 2014/10/13 08:53:36 j_novak Exp $" ;
22
23/*
24 * $Id: ope_sec_order_r2_cl.C,v 1.3 2014/10/13 08:53:36 j_novak Exp $
25 * $Header: /cvsroot/Lorene/C++/Source/Ope_elementary/Ope_sec_order_r2/ope_sec_order_r2_cl.C,v 1.3 2014/10/13 08:53:36 j_novak Exp $
26 *
27 */
28#include <cmath>
29#include <cstdlib>
30
31#include "proto.h"
32#include "ope_elementary.h"
33
34// Version Matrice --> Matrice
35
36 //-------------------
37 //-- Pas prevu ----
38 //-------------------
39
40namespace Lorene {
41Matrice _cl_sec_order_r2_pas_prevu (const Matrice& so) {
42 cout << "CL Sec_order_r2 not implemented" << endl ;
43 abort() ;
44 exit(-1) ;
45 return so;
46}
47
48 //-------------------
49 //-- R_CHEB ------
50 //-------------------
51
52Matrice _cl_sec_order_r2_r_cheb (const Matrice& source) {
53
54 int n = source.get_dim(0) ;
55 assert (n==source.get_dim(1)) ;
56
57 Matrice barre(source) ;
58 int dirac = 1 ;
59 for (int i=0 ; i<n-2 ; i++) {
60 for (int j=0 ; j<n ; j++)
61 barre.set(i, j) = ((1+dirac)*source(i, j)-source(i+2, j))
62 /(i+1) ;
63 if (i==0) dirac = 0 ;
64 }
65
66 Matrice res(barre) ;
67 for (int i=0 ; i<n-4 ; i++)
68 for (int j=0 ; j<n ; j++)
69 res.set(i, j) = barre(i, j)-barre(i+2, j) ;
70
71 return res ;
72}
73
74
76 if (ope_mat == 0x0)
77 do_ope_mat() ;
78
79 if (ope_cl != 0x0)
80 delete ope_cl ;
81
82 // Routines de derivation
83 static Matrice (*cl_sec_order_r2[MAX_BASE])(const Matrice&);
84 static int nap = 0 ;
85
86 // Premier appel
87 if (nap==0) {
88 nap = 1 ;
89 for (int i=0 ; i<MAX_BASE ; i++) {
90 cl_sec_order_r2[i] = _cl_sec_order_r2_pas_prevu ;
91 }
92 // Les routines existantes
93 cl_sec_order_r2[R_CHEB >> TRA_R] = _cl_sec_order_r2_r_cheb ;
94 }
95 ope_cl = new Matrice(cl_sec_order_r2[base_r](*ope_mat)) ;
96}
97
98
99}
Time evolution with partial storage (*** under development ***).
Definition evolution.h:371
Matrix handling.
Definition matrice.h:152
int get_dim(int i) const
Returns the dimension of the matrix.
Definition matrice.C:260
Matrice * ope_mat
Pointer on the matrix representation of the operator.
int base_r
Radial basis of decomposition.
Matrice * ope_cl
Pointer on the banded-matrix of the operator.
virtual void do_ope_mat() const
Computes the matrix of the operator.
virtual void do_ope_cl() const
Computes the banded-matrix of the operator.
#define MAX_BASE
Nombre max. de bases differentes.
#define TRA_R
Translation en R, used for a bitwise shift (in hex)
#define R_CHEB
base de Chebychev ordinaire (fin)
Lorene prototypes.
Definition app_hor.h:64