dsdx_1d.C

    /*
 *   Copyright (c) 2004 Jerome Novak
 *
 *   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
 *
 */
 
 
 
 
/*
 * $Id: dsdx_1d.C,v 1.10 2016/12/05 16:18:07 j_novak Exp $
 * $Log: dsdx_1d.C,v $
 * Revision 1.10  2016/12/05 16:18:07  j_novak
 * Suppression of some global variables (file names, loch, ...) to prevent redefinitions
 *
 * Revision 1.9  2015/03/25 15:03:00  j_novak
 * Correction of a bug...
 *
 * Revision 1.8  2015/03/05 08:49:31  j_novak
 * Implemented operators with Legendre bases.
 *
 * Revision 1.7  2014/10/13 08:53:23  j_novak
 * Lorene classes and functions now belong to the namespace Lorene.
 *
 * Revision 1.6  2014/10/06 15:16:06  j_novak
 * Modified #include directives to use c++ syntax.
 *
 * Revision 1.5  2007/12/12 12:30:48  jl_cornou
 * *** empty log message ***
 *
 * Revision 1.4  2007/12/11 15:28:18  jl_cornou
 * Jacobi(0,2) polynomials partially implemented
 *
 * Revision 1.3  2006/04/10 15:19:20  j_novak
 * New definition of 1D operators dsdx and sx in the nucleus (bases R_CHEBP and
 * R_CHEBI).
 *
 * Revision 1.2  2005/01/10 16:34:53  j_novak
 * New class for 1D mono-domain differential operators.
 *
 * Revision 1.1  2004/02/06 10:53:53  j_novak
 * New dzpuis = 5 -> dzpuis = 3 case (not ready yet).
 *
 *
 * $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/dsdx_1d.C,v 1.10 2016/12/05 16:18:07 j_novak Exp $
 *
 */
 
#include <cmath>
#include <cstdlib>
#include "type_parite.h"
#include "headcpp.h"
#include "proto.h"
 
/*
 * Routine appliquant l'operateur dsdx.
 * 
 * Entree : tb contient les coefficients du developpement 
 *      int nr : nombre de points en r. 
 *
 * Sortie : tb contient dsdx
 * 
 */
 
        //----------------------------------
        // Routine pour les cas non prevus --
        //----------------------------------
 
namespace Lorene {
void _dsdx_1d_pas_prevu(int nr, double* tb, double *xo) {
    cout << "dsdx pas prevu..." << endl ;
    cout << "Nombre de points : " << nr << endl ;
    cout << "Valeurs : " << tb << "  " << xo <<endl ;
    abort() ;
    exit(-1) ;
}
 
            //----------------
            // cas R_CHEBU ---
            //----------------
 
void _dsdx_1d_r_chebu(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    som = 2*(nr-1) * tb[nr-1] ;
    xo[nr-2] = som ;
    for (int i = nr-4 ; i >= 0 ; i -= 2 ) {
      som += 2*(i+1) * tb[i+1] ;
      xo[i] = som ;
    }   // Fin de la premiere boucle sur r
    som = 2*(nr-2) * tb[nr-2] ;
    xo[nr-3] = som ;
    for (int i = nr-5 ; i >= 0 ; i -= 2 ) {
      som += 2*(i+1) * tb[i+1] ;
      xo[i] = som ;
    }   // Fin de la deuxieme boucle sur r
    xo[0] *= .5 ;
 
}
 
 
            //----------------
            // cas R_JACO02 --
            //----------------
 
void _dsdx_1d_r_jaco02(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    for (int i = 0 ; i < nr-1 ; i++ ) {
      som = 0 ;
    for ( int j = i+1 ; j < nr ; j++ ) {
    som += (1 - pow(double(-1),(j-i))*(i+1)*(i+2)/double((j+1)*(j+2)))*tb[j] ;
    }  // Fin de la boucle auxiliaire
      xo[i] = (i+1.5)*som ;
    }   // Fin de la boucle sur R
 
}
 
            //----------------
            // cas R_CHEBI ---
            //----------------
 
void _dsdx_1d_r_chebi(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    som = 2*(2*nr-3) * tb[nr-2] ;
    xo[nr-2] = som ;
    for (int i = nr-3 ; i >= 0 ; i -- ) {
      som += 2*(2*i+1) * tb[i] ;
      xo[i] = som ;
    }   
    xo[0] *= .5 ;
}
 
            //----------------
            // cas R_CHEBP ---
            //----------------
 
void _dsdx_1d_r_chebp(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    som = 4*(nr-1) * tb[nr-1] ;
    xo[nr-2] = som ;
    for (int i = nr-3 ; i >= 0 ; i --) {
      som += 4*(i+1) * tb[i+1] ;
      xo[i] = som ;
    }   
}
 
            //--------------
            // cas R_LEG ---
            //--------------
 
void _dsdx_1d_r_leg(int nr, double* tb, double *xo)
{
    double som ;
        
    xo[nr-1] = 0 ;
    som = tb[nr-1] ;
    xo[nr-2] = double(2*nr-3)*som ;
    for (int i = nr-4 ; i >= 0 ; i -= 2 ) {
    som += tb[i+1] ;
    xo[i] = double(2*i+1)*som ;
    }   // Fin de la premiere boucle sur r
    som = tb[nr-2] ;
    if (nr > 2) xo[nr-3] = double(2*nr-5)*som ;
    for (int i = nr-5 ; i >= 0 ; i -= 2 ) {
    som += tb[i+1] ;
    xo[i] = double(2*i+1)*som ;
    }   // Fin de la deuxieme boucle sur r
}
 
            //---------------
            // cas R_LEGI ---
            //---------------
 
void _dsdx_1d_r_legi(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    som = tb[nr-2] ;
    if (nr > 1) xo[nr-2] = double(4*nr-7)*som ;
    for (int i = nr-3 ; i >= 0 ; i -- ) {
      som += tb[i] ;
      xo[i] = double(4*i+1)*som ;
    }   
}
 
            //---------------
            // cas R_LEGP ---
            //---------------
 
void _dsdx_1d_r_legp(int nr,  double* tb, double *xo)
{
 
    double som ;
        
    xo[nr-1] = 0 ;
    som = tb[nr-1] ;
    if (nr > 1) xo[nr-2] = double(4*nr-5)*som ;
    for (int i = nr-3 ; i >= 0 ; i --) {
      som += tb[i+1] ;
      xo[i] = double(4*i+3)*som ;
    }   
}
 
        // ---------------------
        // La routine a appeler
        //----------------------
        
        
void dsdx_1d(int nr, double** tb, int base_r)
{
 
        // Routines de derivation
    static void (*dsdx_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++) {
        dsdx_1d[i] = _dsdx_1d_pas_prevu ;
    }
        // Les routines existantes
    dsdx_1d[R_CHEBU >> TRA_R] = _dsdx_1d_r_chebu ;
    dsdx_1d[R_CHEBP >> TRA_R] = _dsdx_1d_r_chebp ;
    dsdx_1d[R_CHEBI >> TRA_R] = _dsdx_1d_r_chebi ;
    dsdx_1d[R_CHEB >> TRA_R] = _dsdx_1d_r_cheb ;
    dsdx_1d[R_LEGP >> TRA_R] = _dsdx_1d_r_legp ;
    dsdx_1d[R_LEGI >> TRA_R] = _dsdx_1d_r_legi ;
    dsdx_1d[R_LEG >> TRA_R] = _dsdx_1d_r_leg ;
    dsdx_1d[R_JACO02 >> TRA_R] = _dsdx_1d_r_jaco02 ;
 
    }
    
    double *result = new double[nr] ;
    
    dsdx_1d[base_r](nr, *tb, result) ;
    
    delete [] (*tb) ;
    (*tb) = result ;
}
}