Minimal Residual Method

In mathematics, the generalized minimal residual method (GMRES) is an iterative method for the numerical solution of an indefinite nonsymmetric system of linear equations. The method approximates the solution by the vector in a Krylov subspace with minimal residual. The Arnoldi iteration is used to find this vector.

The GMRES method was developed by Yousef Saad and Martin H. Schultz in 1986. It is a generalization and improvement of the MINRES method due to Paige and Saunders in 1975. The MINRES method requires that the matrix is symmetric, but has the advantage that it only requires handling of three vectors. GMRES is a special case of the DIIS method developed by Peter Pulay in 1980. DIIS is applicable to non-linear systems.

The method

Denote the Euclidean norm of any vector v by $\, v\,$. Denote the (square) system of linear equations to be solved by
:$Ax = b. \,$
The matrix ''A'' is assumed to be invertible of size ''m''-by-''m''. Furthermore, it is assumed that b is normalized, i.e., that $\, b\, = 1$.

The ''n''-th Krylov subspace for this problem is
:$K_n = K_n(A,r_0) = \operatorname \, \. \,$
where $r_0=b-Ax_0$ is the initial error given an initial guess $x_0\ne0$. Clearly $r_0=b$ if $x_0=0$.

GMRES approximates the exact solution of $Ax = b$ by the vector $x_n \in K_n$ that minimizes the Euclidean norm of the residual $r_n= b - Ax_n$.

The vectors $r_0,Ar_0,\ldots A^r_0$ might be close to linearly dependent, so instead of this basis, the Arnoldi iteration is used to find orthonormal vectors $q_1, q_2, \ldots, q_n \,$ which form a basis for $K_n$. In particular, $q_1=\, r_0\, _2^r_0$.

Therefore, the vector $x_n \in K_n$ can be written as $x_n = x_0 + Q_n y_n$ with $y_n \in \mathbb^n$, where $Q_n$ is the ''m''-by-''n'' matrix formed by $q_1,\ldots,q_n$.

The Arnoldi process also produces an ($n+1$)-by-$n$ upper Hessenberg matrix $\tilde_n$ with
:$AQ_n = Q_ \tilde_n. \,$
For symmetric matrices, a symmetric tri-diagonal matrix is actually achieved, resulting in the minres method.

Because columns of $Q_n$ are orthonormal, we have
:$\, r_n \, = \, b - A x_n \, = \, b - A(x_0 + Q_n y_n) \, = \, r_0 - A Q_n y_n \, = \, \beta q_1 - A Q_n y_n \, = \, \beta q_1 - Q_ \tilde_n y_n \, = \, Q_ (\beta e_1 - \tilde_n y_n) \, = \, \beta e_1 - \tilde_n y_n \, , \,$
where
:$e_1 = (1,0,0,\ldots,0)^T \,$
is the first vector in the standard basis of $\mathbb^$, and
:$\beta = \, r_0\, \, ,$
$r_0$ being the first trial vector (usually zero). Hence, $x_n$ can be found by minimizing the Euclidean norm of the residual
:$r_n = \tilde_n y_n - \beta e_1.$
This is a linear least squares problem of size ''n''.

This yields the GMRES method. On the $n$-th iteration:
# calculate $q_n$ with the Arnoldi method;
# find the $y_n$ which minimizes $\, r_n\,$;
# compute $x_n = x_0 + Q_n y_n$;
# repeat if the residual is not yet small enough.
At every iteration, a matrix-vector product $A q_n$ must be computed. This costs about $2m^2$ floating-point operations for general dense matrices of size $m$, but the cost can decrease to $O(m)$ for sparse matrices. In addition to the matrix-vector product, $O(nm)$ floating-point operations must be computed at the ''n'' -th iteration.

Convergence

The ''n''th iterate minimizes the residual in the Krylov subspace $K_n$. Since every subspace is contained in the next subspace, the residual does not increase. After ''m'' iterations, where ''m'' is the size of the matrix ''A'', the Krylov space ''K''_''m'' is the whole of R^''m'' and hence the GMRES method arrives at the exact solution. However, the idea is that after a small number of iterations (relative to ''m''), the vector ''x''_''n'' is already a good approximation to the
exact solution.

This does not happen in general. Indeed, a theorem of Greenbaum, Pták and Strakoš states that for every nonincreasing sequence ''a''₁, ..., ''a''_''m''−1, ''a''_''m'' = 0, one can find a matrix ''A'' such that the , , ''r''_''n'', , = ''a''_''n'' for all ''n'', where ''r''_''n'' is the residual defined above. In particular, it is possible to find a matrix for which the residual stays constant for ''m'' − 1 iterations, and only drops to zero at the last iteration.

In practice, though, GMRES often performs well. This can be proven in specific situations. If the symmetric part of ''A'', that is $(A^T + A)/2$, is positive definite, then
:$\, r_n\, \leq \left( 1-\frac \right)^ \, r_0\, ,$
where $\lambda_(M)$ and $\lambda_(M)$ denote the smallest and largest eigenvalue of the matrix $M$, respectively.

If ''A'' is symmetric and positive definite, then we even have
:$\, r_n\, \leq \left( \frac \right)^ \, r_0\, .$
where $\kappa_2(A)$ denotes the condition number of ''A'' in the Euclidean norm.

In the general case, where ''A'' is not positive definite, we have
:$\frac \le \inf_ \, p(A)\, \le \kappa_2(V) \inf_ \max_ , p(\lambda), , \,$
where ''P''_''n'' denotes the set of polynomials of degree at most ''n'' with ''p''(0) = 1, ''V'' is the matrix appearing in the spectral decomposition of ''A'', and ''σ''(''A'') is the spectrum of ''A''. Roughly speaking, this says that fast convergence occurs when the eigenvalues of ''A'' are clustered away from the origin and ''A'' is not too far from normality.

All these inequalities bound only the residuals instead of the actual error, that is, the distance between the current iterate ''x''_''n'' and the exact solution.

Extensions of the method

Like other iterative methods, GMRES is usually combined with a preconditioning method in order to speed up convergence.

The cost of the iterations grow as O(''n''²), where ''n'' is the iteration number. Therefore, the method is sometimes restarted after a number, say ''k'', of iterations, with ''x''_''k'' as initial guess. The resulting method is called GMRES(''k'') or Restarted GMRES. For non-positive definite matrices, this method may suffer from stagnation in convergence as the restarted subspace is often close to the earlier subspace.

The shortcomings of GMRES and restarted GMRES are addressed by the recycling of Krylov subspace in the GCRO type methods such as GCROT and GCRODR.
Recycling of Krylov subspaces in GMRES can also speed up convergence when sequences of linear systems need to be solved.

Comparison with other solvers

The Arnoldi iteration reduces to the Lanczos iteration for symmetric matrices. The corresponding Krylov subspace method is the minimal residual method (MinRes) of Paige and Saunders. Unlike the unsymmetric case, the MinRes method is given by a three-term recurrence relation. It can be shown that there is no Krylov subspace method for general matrices, which is given by a short recurrence relation and yet minimizes the norms of the residuals, as GMRES does.

Another class of methods builds on the unsymmetric Lanczos iteration, in particular the BiCG method. These use a three-term recurrence relation, but they do not attain the minimum residual, and hence the residual does not decrease monotonically for these methods. Convergence is not even guaranteed.

The third class is formed by methods like CGS and BiCGSTAB. These also work with a three-term recurrence relation (hence, without optimality) and they can even terminate prematurely without achieving convergence. The idea behind these methods is to choose the generating polynomials of the iteration sequence suitably.

None of these three classes is the best for all matrices; there are always examples in which one class outperforms the other. Therefore, multiple solvers are tried in practice to see which one is the best for a given problem.

Solving the least squares problem

One part of the GMRES method is to find the vector $y_n$ which minimizes
:$\, \tilde_n y_n - \beta e_1 \, . \,$
Note that $\tilde_n$ is an (''n'' + 1)-by-''n'' matrix, hence it gives an over-constrained linear system of ''n''+1 equations for ''n'' unknowns.

The minimum can be computed using a QR decomposition: find an (''n'' + 1)-by-(''n'' + 1) orthogonal matrix Ω_''n'' and an (''n'' + 1)-by-''n'' upper triangular matrix $\tilde_n$ such that
:$\Omega_n \tilde_n = \tilde_n.$
The triangular matrix has one more row than it has columns, so its bottom row consists of zero. Hence, it can be decomposed as
:$\tilde_n = \begin R_n \\ 0 \end,$
where $R_n$ is an ''n''-by-''n'' (thus square) triangular matrix.

The QR decomposition can be updated cheaply from one iteration to the next, because the Hessenberg matrices differ only by a row of zeros and a column:
:$\tilde_ = \begin \tilde_n & h_ \\ 0 & h_ \end,$
where ''h''_''n+1'' = (''h''_1,''n+1'', …, ''h''_''n+1,n+1'')^T. This implies that premultiplying the Hessenberg matrix with Ω_''n'', augmented with zeroes and a row with multiplicative identity, yields almost a triangular matrix:
:$\begin \Omega_n & 0 \\ 0 & 1 \end \tilde_ = \begin R_n & r_ \\ 0 & \rho \\ 0 & \sigma \end$
This would be triangular if σ is zero. To remedy this, one needs the Givens rotation
:$G_n = \begin I_ & 0 & 0 \\ 0 & c_n & s_n \\ 0 & -s_n & c_n \end$
where
:$c_n = \frac \quad\mbox\quad s_n = \frac.$
With this Givens rotation, we form
:$\Omega_ = G_n \begin \Omega_n & 0 \\ 0 & 1 \end.$
Indeed,
:$\Omega_ \tilde_ = \begin R_n & r_ \\ 0 & r_ \\ 0 & 0 \end \quad\text\quad r_ = \sqrt$
is a triangular matrix.

Given the QR decomposition, the minimization problem is easily solved by noting that
:$\, \tilde_n y_n - \beta e_1 \, = \, \Omega_n (\tilde_n y_n - \beta e_1) \, = \, \tilde_n y_n - \beta \Omega_n e_1 \, .$
Denoting the vector $\beta\Omega_ne_1$ by
:$\tilde_n = \begin g_n \\ \gamma_n \end$
with ''g''_''n'' ∈ R^''n'' and γ_''n'' ∈ R, this is
:$\, \tilde_n y_n - \beta e_1 \, = \, \tilde_n y_n - \beta \Omega_n e_1 \, = \left\, \begin R_n \\ 0 \end y_n - \begin g_n \\ \gamma_n \end \right\, .$
The vector ''y'' that minimizes this expression is given by
:$y_n = R_n^ g_n.$
Again, the vectors $g_n$ are easy to update.Stoer and Bulirsch, §8.7.2

Example code

Regular GMRES (MATLAB / GNU Octave)

function , e= gmres( A, b, x, max_iterations, threshold)
n = length(A);
m = max_iterations;

% use x as the initial vector
r = b - A * x;

b_norm = norm(b);
error = norm(r) / b_norm;

% initialize the 1D vectors
sn = zeros(m, 1);
cs = zeros(m, 1);
%e1 = zeros(n, 1);
e1 = zeros(m+1, 1);
e1(1) = 1;
e = rror
r_norm = norm(r);
Q(:,1) = r / r_norm;
beta = r_norm * e1; %Note: this is not the beta scalar in section "The method" above but the beta scalar multiplied by e1
for k = 1:m

% run arnoldi
(1:k+1, k), Q(:, k+1)= arnoldi(A, Q, k);

% eliminate the last element in H ith row and update the rotation matrix
(1:k+1, k), cs(k), sn(k)= apply_givens_rotation(H(1:k+1,k), cs, sn, k);

% update the residual vector
beta(k + 1) = -sn(k) * beta(k);
beta(k) = cs(k) * beta(k);
error = abs(beta(k + 1)) / b_norm;

% save the error
e = ; error

if (error <= threshold)
break;
end
end
% if threshold is not reached, k = m at this point (and not m+1)

% calculate the result
y = H(1:k, 1:k) \ beta(1:k);
x = x + Q(:, 1:k) * y;
end

%----------------------------------------------------%
% Arnoldi Function %
%----------------------------------------------------%
function , q