Solubility phase diagrams coupled to computer science (DPAO) part I: Theory of the sequential representation
This article describes a computerized method for processing of data of solubility in order to establish a phase diagram of order equal to or greater than four. The experimental and/or theoretical data are initially coded automatically with a binary number. An iterative algorithm uses these binary nu...
Saved in:
Published in | Calphad Vol. 27; no. 1; pp. 65 - 69 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier Ltd
01.03.2003
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This article describes a computerized method for processing of data of solubility in order to establish a phase diagram of order equal to or greater than four. The experimental and/or theoretical data are initially coded automatically with a binary number. An iterative algorithm uses these binary numbers to classify all the fields of variance according to the Gibbs' phase rule. A new mode of representation, so called “equential”, allows a reciprocal correspondence between the n-dimension space of the components and the 2-dimension space of a graph. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0364-5916 1873-2984 |
DOI: | 10.1016/S0364-5916(03)00031-2 |