Ok, this question may be too broad or fuzzy, if it is please let me know and I'll try and sharpen or narrow it down a bit.
Hi. I am aware of some of the difficulties of defining roots and logarithms of matrices, often there are several or even infinite number of ways to do this. We need to choose a "branch" so to speak. Famous examples include square root functions of complex numbers and many types of logarithms of matrices.
So my question is... would it be possible to reduce the possibilities by imposing extra restrictions on the operation? Are there any typically popular ways to do this and for what applications are they popular?
The Omno's definition of $\log(.)$ has two drawbacks: its domain is very small and practically, we cannot derive the series which defines it.
Let $\log(.)$ be the principal logarithm over $\mathbb{C}$. In the sequel, $A\in M_n(\mathbb{C})$ denotes any matrix with no eigenvalues in $(-\infty,0]$.
STEP 1. If $A$ is diagonalizable: $A=Pdiag(\lambda_i)P^{-1}$, then $\log(A)=Pdiag(\log(\lambda_i))P^{-1}$.
STEP 2. If $A=D+N=D(I+D^{-1}N)=D(I+M)$ (decomposition of Jordan-Chevalley), then $\log(A)=\log(D)+\sum_{k=1}^{n-1}(-1)^{k+1}/k.M^k$.
Properties. 1. $\log(A)$ is a polynomial in $A$.
$\exp(\log(A))=A$.
$\log(A)=\int_0^1(A-I_n)(t(A-I_n)+I_n)^{-1}dt$. This form is interesting because we know how to derive the function $f:A\rightarrow \log(A)$.
$Df_A(H)=\int_0^1(t(A-I_n)+I_n)^{-1}H(t(A-I_n)+I_n)^{-1}dt$.