ALGORITHM FOR FINDING THE DISTRIBUTION OF MAXIMAL ENTROPY

被引：182

作者：

AGMON, N ^{[1
]}

ALHASSID, Y ^{[1
]}

LEVINE, RD ^{[1
]}

机构：

[1] MIT,DEPT CHEM,CAMBRIDGE,MA 02139

来源：

JOURNAL OF COMPUTATIONAL PHYSICS | 1979年 / 30卷 / 02期

关键词：

D O I：

10.1016/0021-9991(79)90102-5

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

An algorithm for determining the distribution of maximal entropy subject to constraints is presented. The method provides an alternative to the conventional procedure which requires the numerical solution of a set of implicit nonlinear equations for the Lagrange multipliers. Here they are determined by seeking a minimum of a concave function, a procedure which readily lends itself to computational work. The program also incorporates two preliminary stages. The first verifies that the constraints are linearly independent and the second checks that a feasible solution exists. © 1979.

引用

页码：250 / 258

页数：9

共 10 条

[1] UPPER BOUND FOR ENTROPY AND ITS APPLICATIONS TO MAXIMAL ENTROPY PROBLEM [J].