Let a block matrix $M$ like
$M=\left( \begin{matrix} A&B& 0 \\ B'&C &0 \\ 0 & 0 &D\end{matrix}\right)$
or any other block symmetric matrix (and invertible) $M$ such that has zeros blocks.
Taking the inverse of M, can I assure that I will always get an inverse with the same structure as M?
For clarify, $M^{-1}$ should be:
$M^{-1}=\left( \begin{matrix} \bar{A}&\bar{B}& 0 \\ \bar{B}'& \bar{C} &0 \\ 0 & 0 & \bar{D}\end{matrix}\right)$
More specifically, can I assure that I will always get an inverse with the structure as follows?
$M^{-1}=\left( \begin{matrix} \pm A^{-1}&B& 0 \\ B'& \pm C^{-1} &0 \\ 0 & 0 &\pm D^{-1}\end{matrix}\right)$
I just need an answer, not a proof. But an 'informal explanation' would be nice.
Let $\cal M$ denote the set of all block diagonal symmetric matrices that have the same size and block structure (with zero blocks) as your given matrix $M$. Note that $\cal M$ contains matrices (like the zero matrix) that are not invertible. This is not important.
Clearly any scalar multiple of a matrix in $\cal M$ is again in $\cal M$. And any finite sum of matrices in $\cal M$ is also in $\cal M$.
Suppose that positive powers of $M$ are also in $\cal M$. (This is true for the example you give). If $M$ is invertible, it follows that $M^{-1}$ is also in $\cal M$. This is because $M^{-1}$ is a sum of scalar multiples of positive powers of $M$, thanks to the Cayley Hamilton Theorem.
The additional structure for the inverse you wonder about --- this additional structure will generally not occur. As an example, take $$ M = \left[\begin{array}{err} 5 & 2 & 0 \\ 2 & 1 & 0 \\ 0& 0& 1 \end{array}\right]. $$ Then $$ M^{-1} = \left[\begin{array}{err} 1 & -2 & 0 \\ -2 & 5 & 0 \\ 0& 0& 1 \end{array}\right]. $$