๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for computing screened Coulomb scattering in Geant4

โœ Scribed by Marcus H. Mendenhall; Robert A. Weller


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
384 KB
Volume
227
Category
Article
ISSN
0168-583X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Algorithm for Computing an Integral B
โœ Mark van Hoeij ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 310 KB

Algorithms for computing integral bases of an algebraic function field are implemented in some computer algebra systems. They are used e.g. for the integration of algebraic functions. The method used by Maple 5.2 and AXIOM is given by Trager in [Trager,1984]. He adapted an algorithm of Ford and Zass

An Improved Algorithm for Module Allocat
โœ Ajith Tom P.; C. Siva Ram Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

We consider the problem of finding an optimal and sub-optimal allocation of program modules onto processors of a distributed computing system. A module causes two types of cost to be incurred at the processor to which it is allocated-an execution cost for processing the module, and a communication c

Polynomials arising in factoring general
โœ S. De Marchi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

We consider generalized Vandermonde determinants of the form vs;.(xl .... ,xs) = Ix~'~l, 1\_< i, k < s, where the x~ are distinct points belonging to an interval [a, b] of the real line, the index s stands for the order, the sequence # consists of ordered integers 0 <\_ #1 < ~2 < โ€ข " < Ps. These de