[Developers] faster ludecomp in C++ for creating adjoint code

[otter]

After much pain I have produced a C++ version of the LU decomposition which
is suitable for producing adjoint code for ADMB and perhaps cppad. 
(Don't know what adjoint
code for cppad is as yet!)  This code is about 25 times faster than the 
current
ADMB code for a 2,000 x 2,000 matrix and about 4 times slower than the 
Openblas
code which contains optimized assembler and Fortrash.  Any suggestion 
for improvements
would be welcome.  Per usual I will hold my breath.


-------------- next part --------------
A non-text attachment was scrubbed...
Name: unblocked.cpp
Type: text/x-c++src
Size: 2692 bytes
Desc: not available
URL: <http://lists.admb-project.org/pipermail/developers/attachments/20140915/b3e7b1f0/attachment.cpp>