The swap could be done without temporaries, but I assume you're also trying to match the look of the pseudocode?
On Wednesday, March 25, 2015 at 11:22:41 AM UTC-4, Jiahao Chen wrote: > > Here is some code I wrote for completely pivoted LU factorizations. > Can you make it even faster? > > Anyone who can demonstrate verifiable speedups (or find bugs relative > to the textbook description) while sticking to pure Julia code wins an > acknowledgment in an upcoming paper I'm writing about Julia, and a > small token of my appreciation with no cash value. :) > > Reference: G. H. Golub and C. F. Van Loan, Matrix Computations 4/e, > Algorithm 3.4.3, p. 132. > > Thanks, > > Jiahao Chen > Staff Research Scientist > MIT Computer Science and Artificial Intelligence Laboratory >
