Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Maximum inner product between two orthgonal vectors (in standard dot procut))

  1. Apr 24, 2012 #1
    Hello buddies,

    Here is my question. It seems simple but at the same time does not seem to have an obvious answer to me.

    Given that you have two vectors [itex]\mathbf{u},\mathbf{v}[/itex].

    • They are orthogonal [itex]\mathbf{u}^T\mathbf{v}=0[/itex] by standard dot product definition.
    • They have norm one [itex]||\mathbf{u}||=||\mathbf{v}||=1[/itex] by standard dot product definition.
    • Define the weighted inner product as [itex]\mathbf{u}^T\left(\begin{matrix}\lambda_1\\&\ddots\\&&\lambda_M\end{matrix}\right)\mathbf{v}[/itex] where [itex]M[/itex] is the number of components. Then the norm according to this inner product is also one for both vectors [itex]\mathbf{u}^T\left(\begin{matrix}\lambda_1\\&\ddots\\&&\lambda_M\end{matrix}\right)\mathbf{u}=
      \mathbf{v}^T\left(\begin{matrix}\lambda_1\\&\ddots\\&&\lambda_M\end{matrix}\right)\mathbf{v}=1[/itex]. Notice the dot product is a particular case where the matrix is the identity.
    • Edit: I forgot to add this [itex]\lambda_1+\cdots+\lambda_M=M[/itex]. It does not make the problem more complicated as it just narrows the possible lambdas.

    What is then the maximum inner product (in absolute value) among two vectors satisfying the previous conditions? I.e.
    [itex]\operatorname{max}\limits_{\mathbf{u},\mathbf{v}}
    \left|
    \mathbf{u}^T\left(\begin{matrix}\lambda_1\\&\ddots\\&&\lambda_M\end{matrix}\right)\mathbf{v}
    \right|[/itex]


    Cheers
     
    Last edited: Apr 24, 2012
  2. jcsd
  3. Apr 24, 2012 #2
    Do you require that the BOTH norms, the standard one and the weighted one are 1?
     
  4. Apr 24, 2012 #3
    Yes.
     
  5. Apr 24, 2012 #4
    Take M=2

    write [itex] u=\begin{array}{c}\cos(\alpha)\\ \sin(\alpha)\end{array}; v=\begin{array}{c}-\sin(\alpha)\\ \cos(\alpha)\end{array}[/itex]

    The weighted norm is then
    [itex] u^T\lambda u = \lambda_1 \cos^2(\alpha) + \lambda_2 \sin^2(\alpha) =1[/itex]
    [itex] v^T\lambda v = \lambda_1 \sin^2(\alpha) + \lambda_2 \cos^2(\alpha)=1[/itex]

    The sum between these gives [itex] \lambda_1+\lambda_2 = 2[/itex]

    The difference gives [itex](\lambda_1 - \lambda_2)(\cos^2(\alpha)-\sin^2(\alpha))=0[/itex]

    Either you use the standard norm, [itex]\lambda_1=\lambda_2=1[/itex] or [itex]\alpha=\pi/2[/itex] (or the 3 other quadrants) and no further restrictions on [itex]\lambda_{1,2}[/itex]

    Then [itex] u^T \lambda v = \frac{1}{2}(\lambda_2 - \lambda_1)[/itex]

    For M>2, find the two [itex]\lambda[/itex] with the largest difference but sum 1 - but I am not entirely sure that there cannot be another, larger solution.

    BTW, is this a homework problem?
     
  6. Apr 24, 2012 #5
    I think you meant [itex]\alpha=\pi/4[/itex] (or [itex]\pi/4+\pi[/itex])
    For [itex]M=2[/itex], the solution only allows these values for the lambdas. I am interested in a generic [itex]M[/itex] which is less obvious.

    I actually forgot to mention [itex]\lambda_1+\cdots+\lambda_M=M[/itex], i.e. the average lambda is one.

    But you derived this conditions imposing orthogonality and norm-1 for vectors of two components. This probably does not carry on for bigger [itex]M[/itex].

    Not at all. I am a theoretical radar engineer.
     
    Last edited: Apr 24, 2012
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Maximum inner product between two orthgonal vectors (in standard dot procut))
  1. Inner e dot product (Replies: 3)

Loading...