2
$\begingroup$

I have a matrix system \begin{equation} \vec{x}(t) = e^{(iAt)} \vec{x}(0) \end{equation} that comes from the solution of the differential system \begin{equation} \frac{d}{dt}\vec{x} = iA\vec{x}, \end{equation} where \begin{equation} e^{(iAt)} = \sum_{k = 0}^{\infty} \frac{(iAt)^k}{k!} \end{equation} and where A is under constraint such that $A_{n,m} = A_{i,j}$ if $i+j = n+m$. Matrix $A$ is a very big matrix (say of size $200\times 200$). I want to find values of $A_{n,m}$ to reach the global minimum of the cost function \begin{equation} O = (\sqrt{Tr(e^{(iAt)})^*Tr(e^{(iAt)})} - 1)^2 \end{equation} where the $(Tr(e^{(iAt)})^*$ is the complex conjugate of the trace, if the global minimum exist. Does anyone have an idea how to tackle this problem?

$\endgroup$
11
  • 4
    $\begingroup$ Aren’t you missing a t in the exponent? Otherwise why is x a function of t? $\endgroup$ Jul 30 at 5:36
  • 6
    $\begingroup$ Just so you know the terminology, matrices satisfying $A_{n,m} = A_{i,j}$ if $i+j = n+m$ are called Hankel matrices. $\endgroup$ Jul 30 at 9:33
  • 5
    $\begingroup$ That function takes complex values if I am not mistaken; is there a modulus missing? $\endgroup$ Jul 30 at 9:47
  • 3
    $\begingroup$ Please resolve (edit) the inconsistency between your last Comment and the "cost" function described currently in the body of your Question. It is worth clarifying there at the same time that your Hankel matrix $A$ has complex entries. A few words about the cases when $A$ is $1\times 1$ and $2\times 2$ would be welcome confirmation that your problem formulation is well-defined. $\endgroup$
    – hardmath
    Jul 31 at 3:08
  • 3
    $\begingroup$ The cost function you show depends on $t$, but the objective function should not. Something is missing. $\endgroup$ Jul 31 at 3:14

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.