I know there is a very beautiful theory for representations over $\Bbb C$, especially the character theory makes it almost trivial to check whether a given representation $G\to\mathrm{GL}(n,\Bbb C)$ is irreducible.
But how can I check this in a similarly algorithmic fashion for representations over $\Bbb R$? I am specifically interested in the case of finite groups.
Question: Given a finite group $G$ and a representation $\rho:G\to\mathrm{GL}(n,\Bbb R)$. How to determine (algorithmically) whether $\rho$ is irreducible?
Note I
I am aware of Frobenius-Schur indicator but I cannot understand whether and how it helps me for my question. At first, I do not have a representation over $\Bbb C$ to start with. And I am not really interested in transforming my irreducible representation over $\Bbb R$ into one or more irreducible representation over $\Bbb C$.
Note II
I avoid using the term "real representation" as it seems to have the meaning of a representation over $\Bbb C$ with a real valued character. I am not very familiar with the connection of this term and "representations over $\Bbb R$" that I use. But please enlighten me.