\begin{algorithm}[t]
\onehalfspacing
\caption{الگوریتم \lr{GMRES}} \label{al1.2}
\begin{latin}
\begin{algorithmic}[1]

\STATE Input :~ intial guess $x_0$, maximal subspace length $m$\\
\STATE Outout:  ~ GMRES iterates $x_m$.\\
\STATE $r_0=b-Ax_0$,~$\beta =\Vert r_0\Vert _2$,\\
\STATE Call Arnoldi $(r_0,m)$, yielding $\bar{H}_m$ and $V_m$\\
\STATE Compute $y_m \in \mathbb{C}^n$,the minimizer of $\Vert \beta e_1-\bar{H}_my_m\Vert_2$\\
\STATE $x_m=x_0+V_my_m$.\\
\end{algorithmic}
\end{latin}
\end{algorithm}