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?
If G has generators {$a_1.... a_r$} where $|a_i|= \infty$ and {$b_1...b_t$} where $|b_i| = m_i$ then G = $\prod_{i=1}^r<a_i> \times \prod_{j=1}^t<b_j>$. But each $\langle a_i \rangle \cong \mathbb Z$ so $\prod_{i=1}^r \cong \mathbb Z^r$ and each $\langle b_j \rangle \cong \mathbb Z_{m_j}$ so $G \cong \mathbb{Z}^r \times Z_{m_1} \times Z_{m_2} \times ... \times Z_{m_t}$