According to page 158 of Dummit and Foote's Abstract Algebra (3rd edition):
Theorem. (Fundamental Theorem of Finitely Generated Abelian Groups) Let $G$ be a finitely generated abelian group. Then
(1) $G \cong \mathbb{Z}^r \times Z_{n_1} \times Z_{n_2} \times … \times Z_{n_s}$, for some integers $r$, $n_1$, $n_2$, … , $n_s$ satisfying the following conditions: (a) $r \ge 0$ and $n_j \ge 2$ for all $j$, and (b) $n_{i+1} \mid n_i$ for $1 \le i \le s-1$
(2) the expression in (1) is unique: if $G\cong \mathbb{Z}^t \times Z_{m_1} \times Z_{m_2} \times … \times Z_{m_u}$, where $t$ and $m_1$, $m_2$, … , $m_u$ satisfy (a) and (b) (i.e., $t \ge 0$, $m_j \ge 2$ for all $j$ and $m_{i+1} \mid m_i$ for $1 \le i \le u-1$), then $t = r$, $u = s$ and $m_i = n_i$ for all $i$.
Question: If an abelian group is expressed as finite generators and their defining relations (for example $G = \langle s,t,u,v \mid s^{4}t^{2}u^{10}v^{6} = s^{8}t^{4}u^{8}v^{10} = s^{6}t^{2}u^{9}v^{8} = e_G\rangle$), how to compute and express the group as a direct sum of cyclic groups and find the corresponding generators satisfying the relations? Could someone explain the computing procedure and show some worked examples? Or could someone point out which textbook taught such computing procedure with worked examples and at which pages/sections?
P.S.1 Although I can't find which textbook taught such computing procedure, Derek Holt gave a link to a PDF document teaching such computing procedure in his comment.
P.S.2. Could someone reply my 2nd comment of lhf's answer and explain how to find that 4 generators in $C_2 \times C_2 \times C_{\infty}$ satisfying the relations?
Best Answer
The tool for this is the Smith Normal Form, a kind of Gaussian elimination for PID.
For the example $G = \langle s,t,u,v \mid s^{4}t^{2}u^{10}v^{6} = s^{8}t^{4}u^{8}v^{10} = s^{6}t^{2}u^{9}v^{8} = e_G \rangle$ written additively, the matrix is $$ \left( \begin{array}{cccc} 4 & 2 & 10 & 6 \\ 8 & 4 & 8 & 10 \\ 6 & 2 & 9 & 8 \\ \end{array} \right) $$ whose Smith Normal Form is $$ \left( \begin{array}{cccc} 1 & 0 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 2 & 0 \\ \end{array} \right) $$ as computed by Mathematica using the code mentioned here.
This means that $G$ is generated by four elements $g_1, g_2, g_3, g_4$ such that $1g_1=0$, $2g_2=0$, $2g_3=0$, and no restrictions on $g_4$, and so $G \cong C_1 \times C_2 \times C_2 \times C_{\infty} \cong C_2 \times C_2 \times C_{\infty}$.
$g_1, g_2, g_3, g_4$ are obtained from $s,t,u,v$ by applying the matrices $P$ and $Q$ such that $PAQ$ is the diagonal matrix above.
All this is explained in several books. One is Finitely Generated Abelian Groups and Similarity of Matrices over a Field by Christopher Norman. A shorter account appears in Jacobson's Basic Algebra I.