[julia-users] Can you make this linear algebra code faster?

[Jiahao Chen]

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

benchmark-opt.jl
Description: Binary data

lucp-opt.jl
Description: Binary data