To solve directly a sparse, unsymmetric matrix equation Ax = b, an equation-ordering algorithm based on local equation decoupling is proposed to maintain a high flow rate of scalar computations within a floating point pipeline. Software is described to solve highly-sparse unpatterned systems efficiently via explicit code generation. Rates in the range of 15 MFLOPS on the CRAY-1 are achieved. (Author)