Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
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.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992