The classic algorithm requires
O (n3) flops, where n is the number of unknowns. Hence,
we need more than 1025 flops to solve the problem. On a teraflop machine, this would take at least
Unfortunately, since the problem is time-dependent, we actually need to solve one of the above problems for each of hundreds or thousands of time steps!
CS1104 Main Page
Last Updated 01/05/2000
© L.Heath, 2000