Approximate structured singular value computation via Frobenius norms

Two algorithms are presented to aid in the approximation of the structured singular value through minimization of the Frobenius norm. The first algorithm allows the uncertain terms to be complex. The second algorithm considers only real variations for real uncertain terms. An example problem is included, and advantages and disadvantages are discussed.<>