svdbip2 - SVD for bipartitioned matrix
SVD for a matrix x partitioned by rows (K) and by columns (H).
Contrarly to svdbip, this function is based on an algorithm without svd. So, divisions for norming vectors might be a problem with svdbip2.
Contrary to svdbip, the stopping rule here is built with the vectors and not with the optimized criterion. Then the calculus is less fast also for this reason.
x=rand(10,20); [u1,v1,cri1]=svdbip(x,[4,6],[3,7,10],3); [u2,v2,cri2]=svdbip2(x,[4,6],[3,7,10],3); cri2,cri1
Kissita Thesis Ceremade Paris Dauphine (2003)