BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-97-1588
       ENTRY:: April 08, 1997
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Systems of Bilinear Equations
        TYPE:: Technical Report
      AUTHOR:: Cohen, Scott
      AUTHOR:: Tomasi, Carlo
        DATE:: April 1997
       PAGES:: 44
    ABSTRACT:: How hard is it to solve a system of bilinear equations? No
               solutions are presented in this report, but the problem is
               posed and some preliminary remarks are made. In particular,
               solving a system of bilinear equations is reduced by a
               suitable transformation of its columns to solving a
               homogeneous system of bilinear equations. In turn, the latter
               has a nontrivial solution if and only if there exist two
               invertible matrices that, when applied to the tensor of the
               coefficients of the system, zero its first column. Matlab
               code is given to manipulate three-dimensional tensors,
               including a procedure that finds one solution to a bilinear
               system often, but not always.
       NOTES:: [Adminitrivia V1/Prg/19970408]
         END:: STAN//CS-TR-97-1588