I was wondering how the QR algorithm could be used to calculate the eigenvalues of matrices containing elements which are members of fields other than R and C. For example, say we have a matrix of functions, these functions all elements of a field (and either never or always zero, maybe exponentials?), or a matrix with elements being members of some other field. If we applied the QR algorithm to this matrix (I would guess this is possible, as Householder reflectors need only multiplication to work, for example, and if we can divide, as in a field, we can generate appropriate reflectors), would it converge?
What conditions, if any, must be imposed on a field other than the field conditions themselves to guarantee/make likely convergence? Is an algebra of some sort necessary (for roots of the characteristic polynomial to exist)?
My background is primarily numerical, and even then not very extensive, so please answer with this in mind!
EDIT: I've removed my reference to finite fields, as this has been answered in the comments below. That said, I am still curious as to what properties a field must have to make the QR algorithm converge.