# majorization check (Scripts) 1.0

Average Rating
User Rating:
Visitors Rating:
My rating:

See full specifications

## majorization check (Scripts) Publisher's description

### MAJLE (Weak) Majorization checkS = MAJLE(X,Y) checks if the real part of X is (weakly) majorized by the real part of Y, where X and Y must be numeric (full or sparse) arrays

MAJLE (Weak) Majorization check
S = MAJLE(X,Y) checks if the real part of X is (weakly) majorized by the real part of Y, where X and Y must be numeric (full or sparse) arrays. It returns S=0, if there is no weak majorization of X by Y, S=1, if there is a weak majorization of X by Y, or S=2, if there is a strong majorization of X by Y. The shapes of X and Y are ignored. NUMEL(X) and NUMEL(Y) may be different, in which case one of them is appended with zeros to match the sizes with the other and, in case of any negative components, a special warning is issued.
S = MAJLE(X,Y,MAJLETOL) allows in addition to specify the tolerance in all inequalities. [S,Z] = MAJLE(X,Y,MAJLETOL) also outputs a row vector Z, which appears in the definition of the (weak) majorization. In the traditional case, where the real vectors X and Y are of the same size, Z = CUMSUM(SORT(Y,'descend')-SORT(X,'descend')). Here, X is weakly majorized by Y, if MIN(Z)>0, and strongly majorized if MIN(Z)=0, see http://en.wikipedia.org/wiki/Majorization

The value of MAJLETOL depends on how X and Y have been computed, i.e., on what the level of error in X or Y is. A good minimal starting point should be MAJLETOL=eps*MAX(NUMEL(X),NUMEL(Y)). The default is 0.

One can use this function to check numerically the validity of the Schur-Horn,Lidskii-Mirsky-Wielandt, and Gelfand-Naimark theorems:

clear all; n=100; majleTol=n*n*eps;
A = randn(n,n); A = A'+A; eA = -sort(-eig(A)); dA = diag(A);
majle(dA,eA,majleTol) % returns the value 2
% which is the Schur-Horn theorem; and
B=randn(n,n); B=B'+B; eB=-sort(-eig(B));
eAmB=-sort(-eig(A-B));
majle(eA-eB,eAmB,majleTol) % returns the value 2
% which is the Lidskii-Mirsky-Wielandt theorem; finally
A = randn(n,n); sA = -sort(-svd(A));
B = randn(n,n); sB = -sort(-svd(B));
sAB = -sort(-svd(A*B));
majle(log2(sAB)-log2(sA), log2(sB), majleTol) % retuns the value 2
majle(log2(sAB)-log2(sB), log2(sA), majleTol) % retuns the value 2
% which are the log versions of the Gelfand-Naimark theorems

Revision: 1.0 \$ \$Date: 15-Mar-2010
Tested in MATLAB 7.9.0.529 (R2009b) and Octave 3.2.3

#### System Requirements:

MATLAB 7.9 (2009b)
Program Release Status: New Release
Program Install Support: Install and Uninstall

#### majorization check (Scripts) Tags:

Click on a tag to find related softwares

## Most Popular

ASK, OOK, FSK, BPSK, QPSK, 8PSK modulation 1.1
ASK, OOK, FSK, BPSK, QPSK, 8PSK modulation contain several functions for digital modulation simulation