An algorithm for computing a solution of a two-matrix alternative is described. Given two square matrices A, B element R (n x n), it computes a nontrivial solution either to |Ax| <= |B||x|, or to |Ay| => |B||y|.
An algorithm for computing a solution of a two-matrix alternative is described. Given two square matrices A, B element R (n x n), it computes a nontrivial solution either to |Ax| <= |B||x|, or to |Ay| => |B||y|. (en)