concorscano

concorgmcano with the set of r solutions simultaneously optimized

The four functions svdcp() ('cp' for column partitioned), svdbip() or svdbip2() ('bip' for bipartitioned), and svdbips() ('s' for a simultaneous optimization of a set of 'r' solutions), correspond to a singular value decomposition (SVD) by blocks notion, by supposing each block depending on relative subspaces, rather than on two whole spaces as usual SVD does. The other functions, based on this notion, are relative to two column partitioned data matrices x and y defining two sets of subsets x_i and y_j of variables and amount to estimate a link between x_i and y_j for the pair (x_i, y_j) relatively to the links associated to all the other pairs. These methods were first presented in: Lafosse R. & Hanafi M.,(1997) <https://eudml.org/doc/106424> and Hanafi M. & Lafosse, R. (2001) <https://eudml.org/doc/106494>.

Fabio Ashtar Telarico

BMconcor

CONCOR for Structural- And Regular-Equivalence Blockmodeling

Roger Lafosse

concorscano function

<dl><dt>x</dt>
<dd>are the <code>n</code> times <code>p</code> and <code>n</code> times <code>q</code> matrices of <code>p</code> and <code>q</code> centered column</dd>
<dt>px</dt>
<dd>A row vector which contains the numbers pi, i=1,...,kx, of the kx subsets xi of x : sum(pi)=sum(px)=p. px is the partition vector of x</dd>
<dt>y</dt>
<dd>See <code>x</code></dd>
<dt>py</dt>
<dd>The partition vector of y. A row vector containing the numbers <code>qi</code> for <code>i = 1,...,ky</code> of the <code>ky</code> subsets <code>yi</code> of <code>y : sum(qi)=sum(py)=q</code>.</dd>
<dt>r</dt>
<dd>The number of wanted successive solutions rmax &lt;= min(min(px),min(py),n)</dd></dl>

Arguments

Author

simultaneous concorgmcano — concorscano

<dl>

<dt>x</dt>
<dd>are the <code>n</code> times <code>p</code> and <code>n</code> times <code>q</code> matrices of <code>p</code> and <code>q</code> centered column</dd>


<dt>px</dt>
<dd>A row vector which contains the numbers pi, i=1,...,kx, of the kx subsets xi of x : sum(pi)=sum(px)=p. px is the partition vector of x</dd>


<dt>y</dt>
<dd>See <code>x</code></dd>


<dt>py</dt>
<dd>The partition vector of y. A row vector containing the numbers <code>qi</code> for <code>i = 1,...,ky</code> of the <code>ky</code> subsets <code>yi</code> of <code>y : sum(qi)=sum(py)=q</code>.</dd>


<dt>r</dt>
<dd>The number of wanted successive solutions rmax &lt;= min(min(px),min(py),n)</dd>

</dl>

concorscano: simultaneous concorgmcano

Description

Usage

Value

Arguments

Author

Details

References

Examples