English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A random close packing based algorithm for the generation of continuous random networks

Hannemann, A., Schön, J. C., & Jansen, M. (2002). A random close packing based algorithm for the generation of continuous random networks. Computer Physics Communications, 144(3), 284-296.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hannemann, A.1, Author           
Schön, J. C.1, 2, Author           
Jansen, M.1, Author           
Affiliations:
1Abteilung Jansen, Former Departments, Max Planck Institute for Solid State Research, Max Planck Society, ou_3370503              
2Department Nanoscale Science (Klaus Kern), Max Planck Institute for Solid State Research, Max Planck Society, ou_3370481              

Content

show
hide
Free keywords: random close packing; continuous random networks optimization covalent amorphous solids
 Abstract: We present a generally applicable method for the modeling of
covalent amorphous networks. The algorithm proceeds by
generating random close packings of anions. followed by an
optimal placement of the cations. As examples, we apply the
algorithm to a-SiO2. a-Si3N4, a-SiO3/2N1/3, and a-B2O3. (C)
2002 Elsevier Science B.V. All rights reserved.

Details

show
hide
Language(s): eng - English
 Dates: 2002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 7302
ISI: 000175755800005
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer Physics Communications
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 144 (3) Sequence Number: - Start / End Page: 284 - 296 Identifier: ISSN: 0010-4655