| New Reply |
Solve for x, a and b in matrix equation aAx + bBx = C |
Share Thread | Thread Tools |
| Jun20-12, 08:23 AM | #1 |
|
|
Solve for x, a and b in matrix equation aAx + bBx = C
Hello everybody
I recently encountered the following equation [itex]C(t) = a\int_0^t{x(\tau)d\tau} + b\int_0^t{\int_0^\tau{x(\tau')d\tau'd\tau}}[/itex], where C, a, b and x are greater or equal to zero. C and x are vectors - in my case around 3500 long - and a and b are constants. If we take sufficiently small steps we can replace the integrals with summations: [itex]C(t) = a\Sigma_0^t{x} + b\Sigma_0^t\Sigma_0^t{x}[/itex]. Such a summation can also be written as a matrix of the form [1 0 0; 1 1 0; 1 1 1] etc. using Matlab notation and [1 0 0; 2 1 0; 3 2 1] etc. for det double summation. Now we have a system: [itex]C = aAx + bBx[/itex] where C and x are Nx1 matrices, a and b are constants, and A and B are NxN matrices. I wish to solve it in some least norm sense for x, a and b, with the constraints that x, a and b should be equal to or greater than zero. I have tried to solve the first equation using some of the nonlinear optimization tools in Matlab with poor results. I hoped it would be easier to solve when rewritten as a linear system, but I cannot see how. Any suggestions would be most welcome. |
| Jun20-12, 09:59 AM | #2 |
|
|
I suppose τ' is a different τ? Like saying τ1 and τ2?
If so, then the inner integral is equal to x(τ2), which yields: [tex]C(t)= a\Sigma_0^t{x} + b\Sigma_0^t{x(τ_2)}[/tex] Edit: Nevermind, I thought it was x'(τ') |
| Jun20-12, 10:05 AM | #3 |
|
|
Ok, I found what was bugging me:
You replaced the double integral with two sums from 0-t. However, the inner sum should be from τ'=0 to τ'=τ, and the outer sum should be τ=0 to τ=t |
| Jun21-12, 03:49 AM | #4 |
|
|
Solve for x, a and b in matrix equation aAx + bBx = C |
| Jun21-12, 04:24 AM | #5 |
|
Recognitions:
|
Welcome to PF, Panteren!
![]() I take it your system is actually the following? $$C(t_i) = aAx(t_i) + bBx(t_i)$$ In that case the solution in a least-norm-sense is given by a least-squares solution. What you'd do is minimize ##\sum_i (C(t_i) - aAx(t_i) + bBx(t_i))^2##, which is the sum-squared deviation given a certain a and b. To solve it you'd calculate the partial derivatives to a and also to b and set them to zero. You'll find the system of equations: $$a \sum_i (Ax(t_i))^2 + b \sum_i Ax(t_i) \cdot Bx(t_i) = \sum_i C(t_i) \cdot Ax(t_i)$$ $$a \sum_i Ax(t_i) \cdot Bx(t_i) + b \sum_i (Bx(t_i))^2 = \sum_i C(t_i) \cdot Bx(t_i)$$ Its solution (for a and b) appears to be what you want. |
| Jun21-12, 11:27 AM | #6 |
|
|
I have read the forums for quite some time. Lots of interesting stuff and insight to be found.If I had [itex]x[/itex] I could just turn it into a standard linear regression problem and likewise if I had the constants [itex]a[/itex] and [itex]b[/itex], but when I only have [itex]A[/itex], [itex]B[/itex], [itex]C[/itex] and the non-negativity constraints on [itex]a[/itex], [itex]b[/itex] and [itex]x[/itex] ... ? |
| New Reply |
| Thread Tools | |
Similar Threads for: Solve for x, a and b in matrix equation aAx + bBx = C
|
||||
| Thread | Forum | Replies | ||
| Solve matrix equation without the inverses. | Precalculus Mathematics Homework | 3 | ||
| Method to solve the matrix equation A A^+ = T, for A | General Math | 0 | ||
| how to solve linear equation in matrix form if determinat is zero | Precalculus Mathematics Homework | 2 | ||
| Solve this tricky Column Matrix equation | Calculus & Beyond Homework | 1 | ||
| how to solve second-order matrix diffrential equation? | Linear & Abstract Algebra | 6 | ||