This article develops some general theory for testing the rank of a matrix. Applications include tests of interaction in two-factor experiments that are more powerful than the usual F test for certain ...
This is a preview. Log in through your library . Abstract The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback