In this work, we answer this question affirmatively. We present a deterministic $\textrm{PTAS}$ for computing the commutative rank of a given matrix space. More specifically, given a matrix space $\mathcal{B}\subseteq\F^{n\times n}$ and a rational number $\epsilon > 0$, we give an algorithm, that runs in time $O(n^{4+\frac{3}{\epsilon}})$ and computes a matrix $A\in\mathcal{B}$ such that the rank of $A$ is at least $(1-\epsilon)$ times the commutative rank of $\mathcal{B}$. The algorithm is the natural greedy algorithm. It always takes the first set of $k$ matrices that will increase the rank of the matrix constructed so far until it does not find any improvement, where the size of the set $k$ depends on $\epsilon$.
This is joint work with Markus Bläser and Anurag Pandey.