So far, I have mostly done linear algebra over $\mathbb R$ and $\mathbb{C}$. I know there exist very many methods to solve equation systems for those fields, of which a few are Gaussian Elimination, Gauss-Jordan, Krylov subspace methods and various approaches based on matrix factorizations.
Inspired by this attempt; What determines if a particular method can be used on matrices of a particular field? Can they all be used on any field or is there some extra set of requirements?
EDIT I am more curious about the requirements on the field regarding computational methods to calculate rather than what is required to guarantee the existance of a particular form. It is good to know that Jordan Normal Form will exist for any matrix if we are working on an algebraically closed field. But will the algorithms to calculate it in practice have to be adapted to the field or are the requirements on fields "strong enough" in some sense to ensure the algorithms will always work?