Hello, I tried to figure out what is the maximum count of arithmetic operation (*,:,+,-) need for gauss elimination and gauss-jordan elimination, but can not get it right.(adsbygoogle = window.adsbygoogle || []).push({});

what I get from wikipedia is

but I dont understand how to get to this result. Gaussian elimination to solve a system of n equations for n unknowns requires n(n+1) / 2 divisions, (2n3 + 3n2 − 5n)/6 multiplications, and (2n3 + 3n2 − 5n)/6 subtractions,[4] for a total of approximately 2n3 / 3 operations. Thus it has arithmetic complexity of O(n3). However, the intermediate entries can grow exponentially large, so it has exponential bit complexity.

Thanks for any help.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Maximum of arithmetic operations needed

Loading...

Similar Threads for Maximum arithmetic operations |
---|

I Can we construct a Lie algebra from the squares of SU(1,1) |

A On spectra |

A Complex operators |

I Question about inverse operators differential operators |

I Proving that an operator is unbounded |

**Physics Forums | Science Articles, Homework Help, Discussion**