parallel-computing

Suppose

@variables x
z = x^3 + x^2 + x + 1

Would be nice to have a degree function that we can use as degree(z,x) to extract the degree of z with respect to x (this will help for multi-variable polynomials too).

Also coeff(z,x) to extract a list of coefficients with respect to he variable x . Thus coeff(z,x^2) returns the coefficient with respect to x^2 and so on.

The standard accelerate test suite, used by all the backends, can be quite slow. Several of the tests are significantly slower than the others, for example segmented folds and scans, which I believe is because the reference implementations are very inefficient. Writing some more efficient reference implementations (e.g. using Data.Vector.Unboxed) should help speed things up.

When computing the isosurface, when 4 simplex edges crosses the isosurface, we add 2 triangles to the isosurface triangulation.

Right now we add these arbitrarily (in these 3 lines) but we should add them so that the curvature is minimized.

The current state o

• core
• mpi