𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method for fast electromagnetic shower simulation in the Geant Monte Carlo program

✍ Scribed by Stephan L. Linn


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
521 KB
Volume
288
Category
Article
ISSN
0168-9002

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A vectorized Monte Carlo detector simula
✍ S. Youssef; W. Martin; T.C. Wan; S. Wilderman πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 392 KB

MC4 is a detector simulation program combining a vectorized ray-tracing algorithm with a vectorized version of the electromagnetic interaction routines from GEANT3. The implementation of ray tracing is able to represent moderately complex geometries such as single calorimeter modules or test-beam si

A fast method to gather neighbors in vec
✍ Claus Vohwinkel πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 429 KB

An algorithm is presented, which gathers neighbors for n-dimensional lattices with periodic boundary conditions. The method used does not need the usual GATHER instructions. With the exception of a few bit-vectors no additional storage is needed. The algorithm can be easily extended to more than nea

A fast vectorized Fortran 77 program for
✍ Hans-Otto Heuer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 904 KB

Multispin coding techniques have been combined with self-consistent boundary conditions to simulate three-dimensional Ising systems at a speed of 305 million spin updates per second, including magnetization and energy calculation, on a single processor of the CRAY YMP 832.

The Simulation–Tabulation Method for Cla
✍ Chi-Ok Hwang; James A. Given; Michael Mascagni πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 264 KB

Many important classes of problems in materials science and biotechnology require the solution of the Laplace or Poisson equation in disordered two-phase domains in which the phase interface is extensive and convoluted. Green's function first-passage (GFFP) methods solve such problems efficiently by