On the representation of a (real) square matrix as a product of two symmetric matrices (For this question, all matrices are real).
According to the ancient paper "Über die Darstellbarkeit einer Matrix als Produkt yon
zwei symmetrischen Matrizen, als Produkt yon zwei
alternierenden Matrizen und als Produkt yon einer symmetrisehen and einer alternieenden Matrix"  by H. Stenzel in Göttingen (1922)
which I cannot really read fully, since it is in German, any square matrix can be written as a product of two symmetric matrices (one of which is non-singular). If we strengthen the conditions, such that one of the factors must be positive-(semi)definite, what can we say? Any way of characterizing square matrices which can be written as a product of a symmetric and a symmetric positive-semidefinit matrix?
If $A$ is symmetric positive-definite and $B$ is symmetric, then the product $AB$ is similar to a symmetric matrix, so has real eigenvalues. So if any square matrix could be written such, all square matrices would have real eigenvalues, which is absurd.  So there must be some restriction.
A version of the paper is here.
And, any more recent references for this problem?
 A: The only restriction is to be diagonalizable with real eigenvalue. For if $M=PDP^{-1}$ with $P,D$ real and $D$ diagonal, then $M=AB$ with $B=P^{-T}DP^{-1}$ symmetric and $A=PP^T$ is PSD. And conversely, such a product is similar to the symmetric matrix $A^{1/2}BA^{1/2}$, hence is diagonalizable with real eigenvalues.
About the fact that every square real matrix is the product of two Hermitian matrices (complex counterpart of what you mention), see Factorization of a real matrix into Hermitian x Hermitian. Is it stable ? .
A: I don't have an answer, but slightly more restrictions.
If $A$ is symmetric positive semidefinite and $B$ is symmetric, $AB = A^{1/2} A^{1/2} B$ has the same characteristic polynomial as the symmetric matrix $C = A^{1/2} B A^{1/2}$, and in particular has real eigenvalues.  If $u$ is an eigenvector of $C$ for nonzero eigenvalue $\lambda$ then $A^{1/2} u \ne 0$ and $AB A^{1/2} u = \lambda A^{1/2} u$, so $A^{1/2}$ maps the eigenspaces 
of $C$ for nonzero eigenvalues to the corresponding eigenspaces of $AB$.
In particular, the geometric and algebraic multiplicities of a nonzero eigenvalue of $AB$ must be equal.  However, this may not be the case for eigenvalue $0$, e.g. 
$$ \pmatrix{0 & 1\cr 0 & 0\cr} = \pmatrix{1 & 0\cr 0 & 0\cr} \pmatrix{0 & 1\cr 1 & 0\cr}$$
EDIT:
On the other hand, $AB$ can't have a Jordan block of size greater than $2$ for eigenvalue $0$.  In fact, suppose $(AB)^3 v = 0$.
Since $\text{Ker}(A) = \text{Ker}(A^{1/2})$, this says $ A^{1/2} B A B A B v = (A^{1/2} B A^{1/2})^2 A^{1/2} B v = 0$, and since $\text{Ker}((A^{1/2} B A^{1/2})^2) = 
\text{Ker}(A^{1/2} B A^{1/2})$ we have
$(A^{1/2} B A^{1/2})A^{1/2} B v = A^{1/2} B A B v = 0$ and thus $(AB)^2 v = 0$.
Since being of the form $AB$ with $A$ and $B$ symmetric and $A$ positive definite is a similarity invariant, i.e. for any matrix $AB$ of this form and any invertible $S$,
$SABS^{-1} = (SAS^T)((S^{-1})^T B S^{-1})$, we see that a necessary and sufficient
condition is that the eigenvalues are real and the only  Jordan blocks of size greater than $1$ are
 $\pmatrix{0 & 1\cr 0 & 0\cr}$.
