source: trunk/source/global/HEPNumerics/include/G4AnalyticalPolSolver.hh

Last change on this file was 1337, checked in by garnier, 15 years ago

tag geant4.9.4 beta 1 + modifs locales

File size: 3.1 KB
Line 
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: G4AnalyticalPolSolver.hh,v 1.5 2006/06/29 18:59:23 gunter Exp $
28// GEANT4 tag $Name: geant4-09-04-beta-01 $
29//
30// Class description:
31//
32// G4AnalyticalPolSolver allows the user to solve analytically a polynomial
33// equation up to the 4th order. This is used by CSG solid tracking functions
34// like G4Torus.
35//
36// The algorithm has been adapted from the CACM Algorithm 326:
37//
38// Roots of low order polynomials
39// Author: Terence R.F.Nonweiler
40// CACM (Apr 1968) p269
41// Translated into C and programmed by M.Dow
42// ANUSF, Australian National University, Canberra, Australia
43// m.dow@anu.edu.au
44//
45// Suite of procedures for finding the (complex) roots of the quadratic,
46// cubic or quartic polynomials by explicit algebraic methods.
47// Each Returns:
48//
49// x=r[1][k] + i r[2][k] k=1,...,n, where n={2,3,4}
50//
51// as roots of:
52// sum_{k=0:n} p[k] x^(n-k) = 0
53// Assumes p[0] != 0. (< or > 0) (overflows otherwise)
54
55// --------------------------- HISTORY --------------------------------------
56//
57// 13.05.05 V.Grichine ( Vladimir.Grichine@cern.ch )
58// First implementation in C++
59
60#ifndef G4AN_POL_SOLVER_HH
61#define G4AN_POL_SOLVER_HH
62
63#include "G4Types.hh"
64
65class G4AnalyticalPolSolver
66{
67 public: // with description
68
69 G4AnalyticalPolSolver();
70 ~G4AnalyticalPolSolver();
71
72 G4int QuadRoots( G4double p[5], G4double r[3][5]);
73 G4int CubicRoots( G4double p[5], G4double r[3][5]);
74 G4int BiquadRoots( G4double p[5], G4double r[3][5]);
75 G4int QuarticRoots( G4double p[5], G4double r[3][5]);
76};
77
78#endif
Note: See TracBrowser for help on using the repository browser.