Recent content by debro5

Yes, thank you. I didn't think of the unfolding procedure. This will help. The part with the error I already knew, but it's okay. So to find the b's, I could now try to invert A or try to find it's pseudo-invert?

This is a better formulation of the problem: \sum\limits_{i = 1}^N {A_i } b_i \; = \;C ...each A_i is a matrix... solution is not unique, but I'm trying to find the b's that minimize: C - \sum\limits_{i = 1}^N {A_i } b_i \;

sorry, should have been C... In fact, the A's represents the gradient of a magnetic field over a given array of current carrying coils. Each coil carry a current b. The A's are numerically computed and I already know the final C. So I have to find the b currents... Hope that helps... Yes, that...

A's and B are n x n real matrices...

I have this system : (A_1 \quad A_2 \quad A_3 \;...)\left( {\matrix{ {b_1 } \cr {b_2 } \cr {b_3 } \cr {...} \cr } } \right) = C where the A's are matrices that forms a vector, b is a vector and C a matrix. If I know C and the A's. How can I find the b's? \left( {\matrix{...