On Sinkhorn's <i>DAD</i> theorem and the self-consistency equation in COSMO-based activity coefficient models (Q6898829)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8122812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Sinkhorn's <i>DAD</i> theorem and the self-consistency equation in COSMO-based activity coefficient models |
scientific article; zbMATH DE number 8122812 |
Statements
On Sinkhorn's <i>DAD</i> theorem and the self-consistency equation in COSMO-based activity coefficient models (English)
0 references
17 November 2025
0 references
This interesting paper studies Sinkhorn's \(DAD\) theorem and the self-consistency equation in COSMO-based activity coefficient models.To set the scene, let us recall Simkorn's result on which this paper is based. In 1964, Sinkhorn constructively proved his \(D1AD2\) theorem which says the following. For each entry wise positive square matrix say \(A\), there exist up to scalar multiples, unique diagonal matrices say \(D1\) and \(D2\) with positive diagonal entries such that the matrix \(D1AD2\) is doubly stochastic, i.e. all row and column sums of the matrix \(D1AD2\) are equal to 1 Follwing this, the Sinkhorn-Knopp algorithm is an iterative method for computing the matrices \(D1\) and \(D2\). There are many applications and extensions of Sinkhorn's result and the Sinkorn-Knopp algorithm which are given in section 1 of the paper under review. Now set \(D1=D2=D\) say. The authors do two things in this paper. Firstly, they provide an interesting connection between Sinkhorn's \(DAD\) theorem and the self-consistency equation in COSMO-based activity coefficient models in chemical engineering. Secondly, the authors construct a new proof of Sinkhorn's \(DAD\) theorem by using classical fixed-point theory.\N\NThe paper is well written with a good set of references.
0 references