OK so here is the latest on this problem. I agree with any poster who said there were an infinite number of solutions, whereas the physical limits of the problem actaully permit one.
Say each matrix x1, x2, and I are nxm matrices. Then since x1 and x2 are both nxm there would be 2*n*m...
So if I understand correctly then you think there does exist a matrix x^ which is the best solution. Unfortunately I am still very unclear as to how to construct this matrix beyond iterative (and too bulky) means.
Ah, I see. My linear algebra is very rusty and I'm really trying to wrap my head around this and solve my problem. I can think of a physical constraint that the sum of all the values in x1 plus the sum of all the vaules in x2 should be equal to the sum of the values in I, but that's not...
Here is the link:
https://www.physicsforums.com/showthread.php?t=519406
I do not mean to square the matrix, I used MATLAB's syntax. What I mean is, say
a = [1 2 3; 4 5 6] then a.^2 = [1 4 9; 16 25 36]
Still perserving it's size of 3x2. I put the square into ensure that x1 and x2 do not come...
Hi, as no unique unique analytical solution exists to my problem (as another poster pointed out), I have taken to solving it through a least squares method. My equation is as follows:
(s1x1 + s2x2 - I).^2 = min.
Here s1 and s2 are shift matrices (I know them), and I is a matrix of size...
Hi, my problem is simple enough to write down but (to me) seems quite difficult to solve.
My equation is as follows
A[x1 x2] = I.
Here I is some known matrix, and A is an operator which applies a shifting matrix and sums. That is A[x1 x2] = s1x1 + s2x2, where s1 and s2 are two shifting...
Hi, I have a bunch of images saved as .fig and I need to obtain the data in these files. I tried something as simple as
image1 = imread('figure1.fig');
but it does not recognize the format. If anyone could help me out that would be greatly appreciated, thanks!