xpundsdx_1d.C

/*
 *   Copyright (c) 1999-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 xpundsdx_1d_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/xpundsdx_1d.C,v 1.1 2007/12/11 15:42:23 jl_cornou Exp $" ;

/*
 * $Id: xpundsdx_1d.C,v 1.1 2007/12/11 15:42:23 jl_cornou Exp $
 * $Log: xpundsdx_1d.C,v $
 * Revision 1.1  2007/12/11 15:42:23  jl_cornou
 * Premiere version des fonctions liees aux polynomes de Jacobi(0,2)
 *
 * Revision 1.2  2002/10/16 14:37:11  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  1999/10/11  09:55:46  phil
 * *** empty log message ***
 *
 *
 * $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/xpundsdx_1d.C,v 1.1 2007/12/11 15:42:23 jl_cornou Exp $
 *
 */
 
 // Includes
#include <stdlib.h>

#include "headcpp.h"
#include "type_parite.h"



        //----------------------------------
        // Routine pour les cas non prevus --
        //----------------------------------

void _xpundsdx_1d_pas_prevu(int nr, double* tb, double *xo) {
    cout << "xpundsdx pas prevu..." << endl ;
    cout << "Nombre de points : " << nr << endl ;
    cout << "Valeurs : " << tb << "  " << xo <<endl ;
    abort() ;
    exit(-1) ;
}


            //---------------
            // cas R_JACO02 -
            //---------------

void _xpundsdx_1d_r_jaco02(int nr, double* tb, double *xo) {
    
    double somme ;
    for (int j = 0 ; j < nr-1 ; j++ ) {
    somme = j*tb[j] ;
    for (int n = j+1 ; n < nr ; n++ ) {
    somme+=(2*j+3)*tb[n];
    } // Fin de la boucle auxiliaire
    xo[j]=somme ;
    } // Fin de la boucle sur R
    xo[nr-1] = (nr-1)*tb[nr-1] ;
}

        // ---------------------
        // La routine a appeler
        //----------------------
        
        
void xpundsdx_1d(int nr, double** tb, int base_r)
{

        // Routines de derivation
    static void (*xpundsdx_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++) {
        xpundsdx_1d[i] = _xpundsdx_1d_pas_prevu ;
    }
        // Les routines existantes
    xpundsdx_1d[R_JACO02 >> TRA_R] = _xpundsdx_1d_r_jaco02 ;
    }
    
    double *result = new double[nr] ;
    
    xpundsdx_1d[base_r](nr, *tb, result) ;
    
    delete [] (*tb) ;
    (*tb) = result ;
}

---