کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
503606 | 863786 | 2010 | 7 صفحه PDF | دانلود رایگان |

This work presents a new Microsoft Visual C# .NET code library, conceived as a general object oriented solution for chaos analysis of three-dimensional, relativistic many-body systems. In this context, we implemented the Lyapunov exponent and the “fragmentation level” (defined using the graph theory and the Shannon entropy). Inspired by existing studies on billiard nuclear models and clusters of galaxies, we tried to apply the virial theorem for a simplified many-body system composed by nucleons. A possible application of the “virial coefficient” to the stability analysis of chaotic systems is also discussed.Program summaryProgram title: Chaos Many-Body Engine v01Catalogue identifier: AEGH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGH_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 30 053No. of bytes in distributed program, including test data, etc.: 801 258Distribution format: tar.gzProgramming language: Visual C# .NET 2005Computer: PCOperating system: .Net Framework 2.0 running on MS WindowsHas the code been vectorized or parallelized?: Each many-body system is simulated on a separate execution threadRAM: 128 MegabytesClassification: 6.2, 6.5External routines: .Net Framework 2.0 LibraryNature of problem: Chaos analysis of three-dimensional, relativistic many-body systems.Solution method: Second order Runge–Kutta algorithm for simulating relativistic many-body systems. Object oriented solution, easy to reuse, extend and customize, in any development environment which accepts .Net assemblies or COM components. Implementation of: Lyapunov exponent, “fragmentation level”, “average system radius”, “virial coefficient”, and energy conservation precision test.Additional comments: Easy copy/paste based deployment method.Running time: Quadratic complexity.
Journal: Computer Physics Communications - Volume 181, Issue 8, August 2010, Pages 1464–1470