What is the complexity of the LU factorization?

3.2k Views Asked by At

Some sources say it is $O(n^3)$, others that it is $n^3/3+O(n^2)$ and on the stackexchange it is $2/3n^3$. I am not very good with the big O notation, can someone explain which answer is the most precise?

1

There are 1 best solutions below

0
On

Matrix operations tend to cast most computation in terms of a Fused Multiply-Add (FMA). Some consider this to count as one floating point operation. Others count the multiply and add separately.

If you count FMAs, then the cost of an LU factorization is approximately $1/3 n^3$. If you count multiplies and adds separately, then the cost is $1/3 n^3$ multiplies and $1/3 n^3$ adds, and hence you end up with $2/3 n^3$ floating point operations (flops).

If Wikipedia says the count is the same as matrix multiplication, then Wikipedia is wrong.