Let $A \in \mathbb{Z}^{n \times n}$ be a positive semidefinite sparse matrix. I am looking for asymptotically fast algorithms to compute for computing the nullspace basis of a $A$ (or just random elements in the nullspace). I wonder whether there are methods that can exploit the fact that $A$ is positive semidefinite sparse matrixto achieve better perfomance.
|
2 | Clarity.; added 3 characters in body; edited tags | ||
|
|
1 |
|
||
Fast algorithms for computing nullspace of a positive semidefinite matrix over ZI am looking for asymptotically fast algorithms to compute the nullspace basis of a positive semidefinite sparse matrix.
|
||||
