Given a matrix $A$ of order $n$, which is symmetric semidefinite positive and at least one of its eigenvalues is zero, I'd like to find an upper bound for the sum of the square of its eigenvalues, expressed in terms of the trace of the matrix.
In literature I could only find the following one: $\mbox{tr}(A^2)\le [\mbox{tr}(A)]^2$
But in my case it is too loose. Is there anything better around? I believe that positive semidefiniteness should play a preminent role here.
EDIT: As correctly pointed out, the elements I have given are insufficient for a tighter bound. I know more about this matrix $A$. In particular $A$ is given by: $P^{1/2}BP^{1/2}$ where $P$ is psd, symmetric, with all elements on the diagonal equal to one (is a correlation matrix) and $B$ is a symmetric idempotent matrix.
EDIT 2: To clarify: if the trace of $A$ is $n-1$ (its maximum possible value), then the trace of $A^2$ is still $n-1$, rather than $(n-1)^2$, whatever the elements of $P$ are. If the trace of $A$ is very close to $n-1$, then the trace of $A^2$ is still very close to $n-1$... That's why I'm expecting a tighter bound on the trace of $A$ rather than simply $[tr(A)]^2$.
See the simulation example in the image... when $trace(A)$ (x-axis) is approaching $2$, the simulation shows clearly that something happens, and the trace of $A^2$ (y-axis) is clearly bounded by another (unknown) function of the trace. I believe that this bound should have something to do with this http://mathoverflow.net/questions/107434/upper-bounds-on-eigenvalues-of-psd-matrix.
Consider the $2 \times 2$ diagonal matrix $$ \begin{bmatrix} u & 0 \\ 0 & 0 \end{bmatrix} $$ with $u \ge 0$ This is symmetric positive semidefinite. Its trace is $u$; the trace of its square is $u^2$; that shows that the bound you've cited is tight. So unless you know more about your matrix than you've told us, there's no tighter bound.