Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Paper
A fast algorithm for solving systems of linear equations with two variables per equation
Abstract
We present a fast algorithm for solving m X n systems of linear equations A x = c with at most two variables per equation. The algorithm makes use of a linear-time algorithm for constructing a spanning forest of an undirected graph, and it requires 5m + 2n - 2 arithmetic operations in the worst case. © 1980.
Related
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997