Given a monad, $(M, \mu, \eta)$, where $M: C \rightarrow C$ for some category $C$, there is a category of factorizations, $F\cdot G = M$ where $F: X \rightarrow C$, $G: C \rightarrow X$. Though this may be a rather open question, does anyone have any examples of calculations whose result is the computation of some particular factorization that has some desired property? What are the methods of calculation? The result of the computation should be a category and the pair $F, G$. What might be an algorithm given a monad on a finite category that computes these objects and functors?
I will assume that G⊣F, And that the maps between factorizations are functors that commute nicely with the units and counits.
As per a comment, I would like to focus on the Kleisli category. With that said, I believe the comment has suggested that there is no way to have a "means" or requirement that would cause you to calculate anything else in the category of factorizations, aside from the category of M-algebras (which is Eilenberg-Moore?). This seems like a question all its own.