The Salsburg Polytope Bound Algorithm: Application to the Imperfect Anharmonic Solid.

Abstract

In order to carry out a cell-cluster analysis of the classical configurational partition function or nu-dimensional hard-particle/lattice systems the authors employ the Salsburg exponential polynomial integration algorithm. The scheme has been generalized in forder to be able to ascertain the contents of irregular convex polytopes which arise on considering imperfect, irregular lattice systems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1971
Accession Number
AD0883190

Entities

People

  • C. Grant Miller
  • Russell D. Larsen

Organizations

  • Illinois Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Drops
  • Embrittlement
  • Liquid Metals
  • Liquids
  • Mathematics
  • Particles
  • Polynomials
  • Sensitivity

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.
  • Materials Science and Engineering.