Gabriele Cosmo
137 lines
5.4 KiB
C++
137 lines
5.4 KiB
C++
//
|
|
// ********************************************************************
|
|
// * License and Disclaimer *
|
|
// * *
|
|
// * The Geant4 software is copyright of the Copyright Holders of *
|
|
// * the Geant4 Collaboration. It is provided under the terms and *
|
|
// * conditions of the Geant4 Software License, included in the file *
|
|
// * LICENSE and available at http://cern.ch/geant4/license . These *
|
|
// * include a list of copyright holders. *
|
|
// * *
|
|
// * Neither the authors of this software system, nor their employing *
|
|
// * institutes,nor the agencies providing financial support for this *
|
|
// * work make any representation or warranty, express or implied, *
|
|
// * regarding this software system or assume any liability for its *
|
|
// * use. Please see the license in the file LICENSE and URL above *
|
|
// * for the full disclaimer and the limitation of liability. *
|
|
// * *
|
|
// * This code implementation is the result of the scientific and *
|
|
// * technical work of the GEANT4 collaboration. *
|
|
// * By using, copying, modifying or distributing the software (or *
|
|
// * any work based on the software) you agree to acknowledge its *
|
|
// * use in resulting scientific publications, and indicate your *
|
|
// * acceptance of all terms of the Geant4 Software license. *
|
|
// ********************************************************************
|
|
//
|
|
//
|
|
// $Id: G4Integrator.hh,v 1.7 2006/06/29 18:59:45 gunter Exp $
|
|
// GEANT4 tag $Name: geant4-09-01 $
|
|
//
|
|
// Class description:
|
|
//
|
|
// Template class collecting integrator methods for generic funtions.
|
|
|
|
// History:
|
|
//
|
|
// 04.09.99 V.Grichine, first implementation based on G4SimpleIntegration class
|
|
// H.P.Wellisch, G.Cosmo, and E.Cherniaev advises
|
|
// 08.09.99 V.Grichine, methods involving orthogonal polynomials
|
|
//
|
|
|
|
|
|
#ifndef G4INTEGRATOR_HH
|
|
#define G4INTEGRATOR_HH 1
|
|
|
|
#include "G4Types.hh"
|
|
#include <cmath>
|
|
|
|
template <class T, class F>
|
|
class G4Integrator
|
|
{
|
|
public: // with description
|
|
|
|
G4Integrator(){;}
|
|
~G4Integrator(){;}
|
|
|
|
G4double Simpson( T& typeT, F f, G4double a, G4double b, G4int n ) ;
|
|
G4double Simpson( T* ptrT, F f, G4double a, G4double b, G4int n ) ;
|
|
G4double Simpson( G4double (*f)(G4double),
|
|
G4double a, G4double b, G4int n ) ;
|
|
// Simpson integration method
|
|
|
|
G4double AdaptiveGauss( T& typeT, F f, G4double a, G4double b, G4double e ) ;
|
|
G4double AdaptiveGauss( T* ptrT, F f, G4double a, G4double b, G4double e ) ;
|
|
G4double AdaptiveGauss( G4double (*f)(G4double),
|
|
G4double a, G4double b, G4double e ) ;
|
|
// Adaptive Gauss method
|
|
|
|
|
|
// Integration methods involving orthogohol polynomials
|
|
|
|
G4double Legendre( T& typeT, F f, G4double a, G4double b, G4int n) ;
|
|
G4double Legendre( T* ptrT, F f, G4double a, G4double b, G4int n) ;
|
|
G4double Legendre( G4double (*f)(G4double), G4double a, G4double b, G4int n) ;
|
|
//
|
|
// Methods involving Legendre polynomials
|
|
|
|
G4double Legendre10( T& typeT, F f,G4double a, G4double b) ;
|
|
G4double Legendre10( T* ptrT, F f,G4double a, G4double b) ;
|
|
G4double Legendre10( G4double (*f)(G4double), G4double a, G4double b) ;
|
|
//
|
|
// Legendre10 is very fast and accurate enough
|
|
|
|
G4double Legendre96( T& typeT, F f,G4double a, G4double b) ;
|
|
G4double Legendre96( T* ptrT, F f,G4double a, G4double b) ;
|
|
G4double Legendre96( G4double (*f)(G4double), G4double a, G4double b) ;
|
|
//
|
|
// Legendre96 is very accurate and fast enough
|
|
|
|
G4double Chebyshev( T& typeT, F f, G4double a, G4double b, G4int n) ;
|
|
G4double Chebyshev( T* ptrT, F f, G4double a, G4double b, G4int n) ;
|
|
G4double Chebyshev( G4double (*f)(G4double), G4double a, G4double b, G4int n) ;
|
|
//
|
|
// Methods involving Chebyshev polynomials
|
|
|
|
G4double Laguerre( T& typeT, F f, G4double alpha, G4int n) ;
|
|
G4double Laguerre( T* ptrT, F f, G4double alpha, G4int n) ;
|
|
G4double Laguerre( G4double (*f)(G4double), G4double alpha, G4int n) ;
|
|
//
|
|
// Method involving Laguerre polynomials
|
|
|
|
G4double Hermite( T& typeT, F f, G4int n) ;
|
|
G4double Hermite( T* ptrT, F f, G4int n) ;
|
|
G4double Hermite( G4double (*f)(G4double), G4int n) ;
|
|
//
|
|
// Method involving Hermite polynomials
|
|
|
|
G4double Jacobi( T& typeT, F f, G4double alpha, G4double beta, G4int n) ;
|
|
G4double Jacobi( T* ptrT, F f, G4double alpha, G4double beta, G4int n) ;
|
|
G4double Jacobi( G4double (*f)(G4double), G4double alpha,
|
|
G4double beta, G4int n) ;
|
|
// Method involving Jacobi polynomials
|
|
|
|
|
|
protected:
|
|
|
|
// Auxiliary function for adaptive Gauss method
|
|
|
|
G4double Gauss( T& typeT, F f, G4double a, G4double b ) ;
|
|
G4double Gauss( T* ptrT, F f, G4double a, G4double b ) ;
|
|
G4double Gauss( G4double (*f)(G4double), G4double a, G4double b) ;
|
|
|
|
void AdaptGauss( T& typeT, F f, G4double a, G4double b,
|
|
G4double e, G4double& sum, G4int& n) ;
|
|
void AdaptGauss( T* typeT, F f, G4double a, G4double b,
|
|
G4double e, G4double& sum, G4int& n ) ;
|
|
void AdaptGauss( G4double (*f)(G4double), G4double a, G4double b,
|
|
G4double e, G4double& sum, G4int& n ) ;
|
|
|
|
G4double GammaLogarithm(G4double xx) ;
|
|
|
|
|
|
} ;
|
|
|
|
#include "G4Integrator.icc"
|
|
|
|
#endif
|