Linear Equation Solutions: A Systematic Approach for n1xn2 and n1xm2 Matrices

phynewb
Messages
13
Reaction score
0
Hi guys

I wonder if you know any linear algebra formalism or something to solve the following question systematically?

Give A,B with A=n1xn2 matrix and B=n1xm2 matrix.
How do we get C=n2xm2 matrix such that A*C=B.
A simple example if A=(1,2)^t, B=(2,4)^t, then C=2

The question is how to solve C given A and B.
Thanks
 
Physics news on Phys.org
That depends upon how many dimensions A and B have. In the example you give the simplest method is the write out the components and solve the resulting system of equations. Since A is "1 by 2" and B is "2 by 1", C must be a 1 by 1 matrix (a single number) and AC= B becomes
\begin{bmatrix}1 \\ 2\end{bmatrix}\begin{bmatrix}c\end{bmatrix}= \begin{bmatrix}c \\ 2c\end{bmatrix}= \begin{bmatrix}2 \\ 4\end{bmatrix}
which gives the two equations c= 2 and 2c= 4 so that c= 2. Of course, if B has NOT been a simple multiple of A, there would not have been any solution.
 
If you think about how matrix multiplication AC is defined, the i'th column of C only affects the i'th column of B.

So you only need to consider the simpler problem where C and B are vectors.

This is just a set of linear equations, which may have zero, one, or more than one solution depending on the row and column dimensions of A and the rank of A. The details should be covered in any course on linear algebra, or numerical methods for solving linear equations.
 
Thanks AlephZero and HallsofIvy.

I guess the example is too simple.
I like to consider the general case.
Here is the way I solve it.
Want to solve C with AC=B.
Multiply A^t on both sides A^t.A.C=A^t.B
Now A^t.A^t is a square matrix so I can calculate its inverse (if it is not singular)
Then I get C=(A^t.A)^-1.A^t.B (1)

However if I calculate C in this way, something goes wrong!
For example,
Say A=[1,2]^t, B=[[1,0,2],[2,1,0]]
By(1) C=1/5[5,2,2]
But A.C=1/5[[5,2,2],[10,4,4]]\=B.
So I wonder what is wrong with (1).
Why does (1) get correct C such that A.C=B?
 
##\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...
Back
Top