[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: lu decomposition without any permutations
From: |
David Bateman |
Subject: |
Re: lu decomposition without any permutations |
Date: |
Thu, 14 Feb 2008 17:17:51 +0100 |
User-agent: |
Thunderbird 2.0.0.6 (X11/20070914) |
Przemek Klosowski wrote:
> I think it is permuting the rows because you are asking it to permute the
> rows by
> providing the parameter p. If you don't it doesn't permute:
>
> a=rand(5); [l, u] = lu(a); l*u-a
>
No, it'll still pivot in this case. The only difference is that the
permutation matrix is incorporated in the L matrix.
a=rand(3); [l, u] = lu(a)
l =
0.87085 1.00000 0.00000
0.72097 -0.43703 1.00000
1.00000 0.00000 0.00000
u =
0.97382 0.39181 0.47502
0.00000 0.41088 0.07799
0.00000 0.00000 0.28099
norm (l *u-a)
ans = 1.5732e-16
D.
--
David Bateman address@hidden
Motorola Labs - Paris +33 1 69 35 48 04 (Ph)
Parc Les Algorithmes, Commune de St Aubin +33 6 72 01 06 33 (Mob)
91193 Gif-Sur-Yvette FRANCE +33 1 69 35 77 01 (Fax)
The information contained in this communication has been classified as:
[x] General Business Information
[ ] Motorola Internal Use Only
[ ] Motorola Confidential Proprietary