Hello everyone,
I've been successful in writing the symbolic cholesky decomposition
for sparse matrices in O(n * c**2) time. This is a reasonable order
for sparse systems, but still the performance is not very good. Using
python bulitins, It factors a 100 * 100 Matrix with sparsity 0.57 in
961 mill
Hi,
On 28 May 2011 15:30, SherjilOzair wrote:
> Hello everyone,
> I've been successful in writing the symbolic cholesky decomposition
> for sparse matrices in O(n * c**2) time. This is a reasonable order
> for sparse systems, but still the performance is not very good. Using
> python bulitins, I
> In [1] you will find a very simple comparison of Integer, int and mpz. This
> applies to the rational case as well, just the difference is even bigger.
Did you make those graphs manually, or do you have some program that automates
it? It would be nice to have something that can make timing gr
Hi,
On 3 June 2011 01:15, Aaron S. Meurer wrote:
> > In [1] you will find a very simple comparison of Integer, int and mpz.
> This applies to the rational case as well, just the difference is even
> bigger.
>
> Did you make those graphs manually, or do you have some program that
> automates it?
I see. It would be nice to have a function, call it timings_graph() or
something, that acts similar to the timed() function. You just pass it some
lists of source code that you want to plot (or maybe multiple lists for
multiple lines), a list of x-axis values, and other information like axes
I created http://code.google.com/p/sympy/issues/detail?id=2445 for this.
Aaron Meurer
On Jun 2, 2011, at 9:01 PM, Aaron S. Meurer wrote:
> I see. It would be nice to have a function, call it timings_graph() or
> something, that acts similar to the timed() function. You just pass it some
> li
