The problem of rank-one approximation of symmetric tensors is important in
independent components analysis, also known as blind source separation, as well
as polynomial optimization. The rank-one approximation problem reduces to
finding the principal Z eigenvector, and an effective algorithm was recently
discovered for computing symmetric tensor eigenvectors.