lu decomposition without any permutations

[Kamaraju S Kusumanchi]

Consider

octave:25> a = [1 2; 3 5]
a =

   1   2
   3   5

octave:26> [l, u, p] = lu(a)
l =

   1.000000000000000   0.000000000000000
   0.333333333333333   1.000000000000000

u =

   3.000000000000000   5.000000000000000
   0.000000000000000   0.333333333333333

p =

   0   1
   1   0


Here the decomposition corresponds to p*a (which is what is needed in most
of the cases). However, I am wondering if it would be possible to perform
an lu decomposition in octave without any permutation of rows? The exact
reason why I want to do this is kind of complicated. But would appreciate
if someone can give me a hint.

thanks
raju

-- 
Kamaraju S Kusumanchi
http://www.people.cornell.edu/pages/kk288/
http://malayamaarutham.blogspot.com/