| 1 | //
|
|---|
| 2 | // ********************************************************************
|
|---|
| 3 | // * License and Disclaimer *
|
|---|
| 4 | // * *
|
|---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of *
|
|---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and *
|
|---|
| 7 | // * conditions of the Geant4 Software License, included in the file *
|
|---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These *
|
|---|
| 9 | // * include a list of copyright holders. *
|
|---|
| 10 | // * *
|
|---|
| 11 | // * Neither the authors of this software system, nor their employing *
|
|---|
| 12 | // * institutes,nor the agencies providing financial support for this *
|
|---|
| 13 | // * work make any representation or warranty, express or implied, *
|
|---|
| 14 | // * regarding this software system or assume any liability for its *
|
|---|
| 15 | // * use. Please see the license in the file LICENSE and URL above *
|
|---|
| 16 | // * for the full disclaimer and the limitation of liability. *
|
|---|
| 17 | // * *
|
|---|
| 18 | // * This code implementation is the result of the scientific and *
|
|---|
| 19 | // * technical work of the GEANT4 collaboration. *
|
|---|
| 20 | // * By using, copying, modifying or distributing the software (or *
|
|---|
| 21 | // * any work based on the software) you agree to acknowledge its *
|
|---|
| 22 | // * use in resulting scientific publications, and indicate your *
|
|---|
| 23 | // * acceptance of all terms of the Geant4 Software license. *
|
|---|
| 24 | // ********************************************************************
|
|---|
| 25 | //
|
|---|
| 26 | //
|
|---|
| 27 | // $Id: G4ClassicalRK4.cc,v 1.14 2009/03/25 15:29:02 gcosmo Exp $
|
|---|
| 28 | // GEANT4 tag $Name: geant4-09-04-beta-01 $
|
|---|
| 29 | //
|
|---|
| 30 | // -------------------------------------------------------------------
|
|---|
| 31 |
|
|---|
| 32 | #include "G4ClassicalRK4.hh"
|
|---|
| 33 | #include "G4ThreeVector.hh"
|
|---|
| 34 |
|
|---|
| 35 | //////////////////////////////////////////////////////////////////
|
|---|
| 36 | //
|
|---|
| 37 | // Constructor sets the number of variables (default = 6)
|
|---|
| 38 |
|
|---|
| 39 | G4ClassicalRK4::
|
|---|
| 40 | G4ClassicalRK4(G4EquationOfMotion* EqRhs, G4int numberOfVariables)
|
|---|
| 41 | : G4MagErrorStepper(EqRhs, numberOfVariables)
|
|---|
| 42 | {
|
|---|
| 43 | unsigned int noVariables= std::max(numberOfVariables,8); // For Time .. 7+1
|
|---|
| 44 |
|
|---|
| 45 | dydxm = new G4double[noVariables];
|
|---|
| 46 | dydxt = new G4double[noVariables];
|
|---|
| 47 | yt = new G4double[noVariables];
|
|---|
| 48 | }
|
|---|
| 49 |
|
|---|
| 50 | ////////////////////////////////////////////////////////////////
|
|---|
| 51 | //
|
|---|
| 52 | // Destructor
|
|---|
| 53 |
|
|---|
| 54 | G4ClassicalRK4::~G4ClassicalRK4()
|
|---|
| 55 | {
|
|---|
| 56 | delete[] dydxm;
|
|---|
| 57 | delete[] dydxt;
|
|---|
| 58 | delete[] yt;
|
|---|
| 59 | }
|
|---|
| 60 |
|
|---|
| 61 | //////////////////////////////////////////////////////////////////////
|
|---|
| 62 | //
|
|---|
| 63 | // Given values for the variables y[0,..,n-1] and their derivatives
|
|---|
| 64 | // dydx[0,...,n-1] known at x, use the classical 4th Runge-Kutta
|
|---|
| 65 | // method to advance the solution over an interval h and return the
|
|---|
| 66 | // incremented variables as yout[0,...,n-1], which not be a distinct
|
|---|
| 67 | // array from y. The user supplies the routine RightHandSide(x,y,dydx),
|
|---|
| 68 | // which returns derivatives dydx at x. The source is routine rk4 from
|
|---|
| 69 | // NRC p. 712-713 .
|
|---|
| 70 |
|
|---|
| 71 | void
|
|---|
| 72 | G4ClassicalRK4::DumbStepper( const G4double yIn[],
|
|---|
| 73 | const G4double dydx[],
|
|---|
| 74 | G4double h,
|
|---|
| 75 | G4double yOut[])
|
|---|
| 76 | {
|
|---|
| 77 | const G4int nvar = this->GetNumberOfVariables(); // fNumberOfVariables();
|
|---|
| 78 | G4int i;
|
|---|
| 79 | G4double hh = h*0.5 , h6 = h/6.0 ;
|
|---|
| 80 |
|
|---|
| 81 | // Initialise time to t0, needed when it is not updated by the integration.
|
|---|
| 82 | // [ Note: Only for time dependent fields (usually electric)
|
|---|
| 83 | // is it neccessary to integrate the time.]
|
|---|
| 84 | yt[7] = yIn[7];
|
|---|
| 85 | yOut[7] = yIn[7];
|
|---|
| 86 |
|
|---|
| 87 | for(i=0;i<nvar;i++)
|
|---|
| 88 | {
|
|---|
| 89 | yt[i] = yIn[i] + hh*dydx[i] ; // 1st Step K1=h*dydx
|
|---|
| 90 | }
|
|---|
| 91 | RightHandSide(yt,dydxt) ; // 2nd Step K2=h*dydxt
|
|---|
| 92 |
|
|---|
| 93 | for(i=0;i<nvar;i++)
|
|---|
| 94 | {
|
|---|
| 95 | yt[i] = yIn[i] + hh*dydxt[i] ;
|
|---|
| 96 | }
|
|---|
| 97 | RightHandSide(yt,dydxm) ; // 3rd Step K3=h*dydxm
|
|---|
| 98 |
|
|---|
| 99 | for(i=0;i<nvar;i++)
|
|---|
| 100 | {
|
|---|
| 101 | yt[i] = yIn[i] + h*dydxm[i] ;
|
|---|
| 102 | dydxm[i] += dydxt[i] ; // now dydxm=(K2+K3)/h
|
|---|
| 103 | }
|
|---|
| 104 | RightHandSide(yt,dydxt) ; // 4th Step K4=h*dydxt
|
|---|
| 105 |
|
|---|
| 106 | for(i=0;i<nvar;i++) // Final RK4 output
|
|---|
| 107 | {
|
|---|
| 108 | yOut[i] = yIn[i]+h6*(dydx[i]+dydxt[i]+2.0*dydxm[i]); //+K1/6+K4/6+(K2+K3)/3
|
|---|
| 109 | }
|
|---|
| 110 | if ( nvar == 12 ) { NormalisePolarizationVector ( yOut ); }
|
|---|
| 111 |
|
|---|
| 112 | } // end of DumbStepper ....................................................
|
|---|
| 113 |
|
|---|
| 114 | ////////////////////////////////////////////////////////////////////
|
|---|
| 115 | //
|
|---|
| 116 | // StepWithEst
|
|---|
| 117 |
|
|---|
| 118 | void
|
|---|
| 119 | G4ClassicalRK4::StepWithEst( const G4double*,
|
|---|
| 120 | const G4double*,
|
|---|
| 121 | G4double,
|
|---|
| 122 | G4double*,
|
|---|
| 123 | G4double&,
|
|---|
| 124 | G4double&,
|
|---|
| 125 | const G4double*,
|
|---|
| 126 | G4double* )
|
|---|
| 127 | {
|
|---|
| 128 | G4Exception("G4ClassicalRK4::StepWithEst()", "ObsoleteMethod",
|
|---|
| 129 | FatalException, "Method no longer used.");
|
|---|
| 130 |
|
|---|
| 131 | } // end of StepWithEst ......................................................
|
|---|
| 132 |
|
|---|
