Matematické Fórum

↑ eminich:,
Uz som dal odpoved tu na takuto otazku ( kde presne ?  iste ze je to v testo rubrike)
Hladaj

Srdecne Vanok

↑ eminich:,
precitaj si to:
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.

biblio si najdi na internete

Srdecne Vanok

↑ eminich:,
V citacii mas odpovede na kazdu operaciu a som isty ze to si schopny dokazat:
Napriklad

citujem   .....  requires n(n+1) / 2 divisions....
To je presne tam kde budu 0 (nuly)  1 na diagonale (uhlopriecke) 
JE ich  1 + 2  +... + n

ATD

A ak chces trochu viac vediet  mozes citat napriklad toto
http://en.wikipedia.org/wiki/Computatio … ity_theory

Nemate na tvoj unevirzine nejake prednasky o tom???  Kontaktuj profesora co to rob u vas, iste ti rad poradi.
Srdecne Vanok