I am trying to determine the nullspace of a large symbolic matrix. The single core evolution seems to take too long. I tried
Parallelize on the commands
LinearSolve and on
NullSpace without success. I got messages like
NullSpace[M] cannot be parallelized; proceeding with sequential \ evaluation
Is there any way to parallise the computation of the Nullspace? My only idea is to slice the matrix like
and then to compute the nullspace for each slice. Then calculate the intersection of the nullspaces as described here (maybe there is a more efficient way than to do this).
Any suggestion is highly appreciated.