I Help solving a System of Linear Equations

marcusl
Science Advisor
Messages
2,958
Reaction score
668
I have the following equation to solve for the coefficients b:
\sum\limits_{m,n=0}^N b_m b_n^* (x_{mn}+y_{mn}) e^{ ik (ux_{mn} + vy_{mn}) } = 0
which must be satisfied for all u and v in the interval [-1,1]. Here k is a constant, b is a vector of length N with unit norm
||b||^2=1,
and x and y are vectors of constants with
x_{mn}=x_m-x_n \text{ and } y_{mn}=y_m-y_n.
This equation arises in an analysis of plane waves incident on an array of sensors; the question (not homework) is to find weights on the various sensors such that the weighted element voltages sum to create an omni-directional sensitivity power pattern. I am happy to provide the derivation of how the physical system leads to this equation if it would be helpful.

Arguing from physical intuition, the sole solution appears to me that all b_m=0 except for one (call it b_0, it doesn't matter which we choose) that has unity modulus, b_0=e^{i\phi}. This works because x_{00}=y_{00}=0 and is equivalent physically to turning M-1 sensors off and receiving with just a single active sensor. Choosing the arbitray constant as \phi=0 results in
\mathbf{b}\rm=\array{[1&0&&0&...&0]}^T
where, again, the indexing is arbitrary so we can assign the active element to any element in the array.

Can anyone suggest a more rigorous argument?
 
Last edited:
Physics news on Phys.org
Your problem isn't linear in ##\mathbf{b}##.

Things that come to mind are inverting the FFT?
 
I see issues with an FFT. First, x and y don't ncessarily have regular spacing, so this expression is not a DFT. We could take a DFT of both sides, but I don't think that simplifies anything.

As for the title of my post--Oops, obviously the equation is nonlinear. I had started with an earlier version of the problem involving the electric field (rather than power) pattern
\sum\limits_{n=0}^{N-1} b_n e^{ -ik (ux_n + vy_n) } = \alpha e^{i\phi(u,v)}
then failed to notice that the title needed to change. Perhaps this linear form is easier to deal with, but it has a constant \alpha and a function \phi(u,v) that are arbitrary, so I wasn't sure what to do with it.

EDIT: corrected upper limit
 
Last edited:
Well, the linear form is a general problem of the ##A x = b## type where ##x_n = b_n## and ##b = \alpha e^{i\phi(u,v)}## discretely sampled. You could try one of many approaches to linear systems LU or QR or singular value decomposition. Depends of the size of ##N##. How badly do you want a solution?
 
Paul, these are numerical techniques that won't work when your A is a function and b is unspecified. I'm looking for a general demonstration or proof that the solution is of the form b=[1 0 0 ... 0].
 
marcusl said:
I'm looking for a general demonstration or proof that the solution is of the form b=[1 0 0 ... 0].
I'm confused. Aren't there many counter examples given ##\phi## is arbitrary? Proof, assume a solution not of this form. Compute the corresponding ##\phi##?
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top