Expressing a matrice as a sum of two non singular matrices

  • Thread starter Thread starter vish_maths
  • Start date Start date
  • Tags Tags
    Matrices Sum
vish_maths
Messages
60
Reaction score
1
Hello everyone , So here is this problem which i was recently thinking about
Expressing any matrix as the sum of two non singular matrices
So, when i think of ways to express a matrix as sum of two matrices, the thought which
comes first is :

(a) Any matrix can be expressed as the sum of a symmetric and an asymmetric matrix
but an asymmetric matrix is always singular which means this option is ruled out

(b) Suppose A and B are two non Singular matrices. There ought to be some technique
of factorising A and B so that some common terms exist and when i combine these two, a term is obtained whose property defines whether the resulting matrix is singular or not

What can be such a factorisation ?
 
Last edited:
Physics news on Phys.org
Perhaps express it as a sum of an upper-triangular and a lower-triangular matrix??

When is a triangular matrix non-singular??
 
but an asymmetric matrix is always singular which means this option is ruled out

Where did you get that idea? First, "asymmetric" simply means "not symmetric"- you mean "anti-symmetric". And even for anti-symmetric matrices, this is not true:
\begin{bmatrix}0 & -1 \\ 1 & 0\end{bmatrix}
is anti-symmetric but has determinant 1 and so is not singular.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top