that's the solution to a problem I added to the lab. It's not a great
problem, but I need to move on to other stuff for now.


On Mon, Aug 26, 2013 at 10:52 PM, Ian Henriksen <notifications@github.com>wrote:

> In Algorithms/LUdecomposition/LUdecomposition.py:
>
> > +        # the fast way
> > +        for i in xrange(B.shape[0]):
> > +            la.lu_solve(LU,B[i])
> > +    else:
> > +        # the slow way
> > +        for i in xrange(B.shape[0]):
> > +            la.solve(A,B[i])
> > +
> > +def timeProblem(f):
> > +    A = np.random.random((500,500))
> > +    while (la.det(A) == 0):
> > +        A = np.random.random((500,500))
> > +    B = np.random.random((500,500))
> > +    ALU = la.lu_factor(A)
> > +    # python doesn't let me run the timer inside of a function
> > +    # %timeit solveLoop(A,ALU,B,f)
>
> What's going on here?
>
> —
> Reply to this email directly or view it on GitHub<https://github.com/byuimpact/numerical_computing/pull/281/files#r5997176>
> .
>



-- 
Abe Frandsen