Square root of a squared block matrix

GoodSpirit
Messages
18
Reaction score
0
Hi everybody,

I’m trying to compute the square root of the following squared block matrix:

<br /> \begin{equation}<br /> M=\begin{bmatrix}<br /> A &amp;B\\<br /> C &amp;D\\<br /> \end{bmatrix}<br /> \end{equation}<br />

(that is M^(1/2))as function of A,B,C, D which are all square matrices.

Can you help me?

I sincerely thank you! :)

All the best

GoodSpirit
 
Physics news on Phys.org
Hi GoodSpirit! :smile:

Have you tried transforming it into the form
<br /> \begin{equation}<br /> M=\begin{bmatrix}<br /> P &amp;0\\<br /> 0 &amp;Q\\<br /> \end{bmatrix}<br /> \end{equation}<br />
 
Hi tiny-tim,

Thank you for answering.
That´s an interesting idea but how do you do that...?
It is not easy...
I must say that there is more...
M is a typical covariance matrix so it is symmetric and semi-positive definite.

A and D are symmetric and positive semi-definite (covariance matrices too) and B=C^T and B is the cross covariance matrix of A and D.

My attempt is based on eigendecomposition
$$ M=Q \Lambda Q^T $$
and
$$
M=\begin{bmatrix}
a & b \\
c & d \\
\end{bmatrix}
\begin{bmatrix}
a & b \\
c & d \\
\end{bmatrix}
$$

But it lead to something very complicated.

I really thank you all for your answer!:)

All the best

GoodSpirit
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\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...
Back
Top