```dir    templates
for     Base Directory

file    bicg.h
for     //*****************************************************************
,       // Iterative template routine -- BiCG
,       //
,       // BiCG solves the unsymmetric linear system Ax = b
,       // using the Preconditioned BiConjugate Gradient method
,       //
,       // BiCG follows the algorithm described on p. 22 of the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    2037 kb

file    bicgstab.h
for     //*****************************************************************
,       // Iterative template routine -- BiCGSTAB
,       //
,       // BiCGSTAB solves the unsymmetric linear system Ax = b
,       // using the Preconditioned BiConjugate Gradient Stabilized method
,       //
,       // BiCGSTAB follows the algorithm described on p. 27 of the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    2227 kb

file    cg.h
for     //*****************************************************************
,       // Iterative template routine -- CG
,       //
,       // CG solves the symmetric positive definite linear
,       // system Ax=b using the Conjugate Gradient method.
,       //
,       // CG follows the algorithm described on p. 15 in the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    1711 kb

file    cgs.h
for     //*****************************************************************
,       // Iterative template routine -- CGS
,       //
,       // CGS solves the unsymmetric linear system Ax = b
,       // using the Conjugate Gradient Squared method
,       //
,       // CGS follows the algorithm described on p. 26 of the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    1978 kb

file    cheby.h
for     //*****************************************************************
,       // Iterative template routine -- CHEBY
,       //
,       // CHEBY solves the symmetric positive definite linear
,       // system Ax = b using the Preconditioned Chebyshev Method
,       //
,       // CHEBY follows the algorithm described on p. 30 of the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    2092 kb

file    gmres.h
for     //*****************************************************************
,       // Iterative template routine -- GMRES
,       //
,       // GMRES solves the unsymmetric linear system Ax = b using the
,       // Generalized Minimum Residual method
,       //
,       // GMRES follows the algorithm described on p. 20 of the
,       // SIAM Templates book.
,       //
,       // The return value indicates convergence within max_iter (input)
size    3400 kb

file    ir.h
for     //*****************************************************************
,       // Iterative template routine -- Preconditioned Richardson
,       //
,       // IR solves the unsymmetric linear system Ax = b using
,       // Iterative Refinement (preconditioned Richardson iteration).
,       //
,       // The return value indicates convergence within max_iter (input)
,       // iterations (0), or no convergence within max_iter iterations (1).
,       //
,       // Upon successful return, output arguments have the following values:
size    1379 kb

file    qmr.h
for     //*****************************************************************
,       // Iterative template routine -- QMR
,       //
,       // QMR.h solves the unsymmetric linear system Ax = b using the
,       // Quasi-Minimal Residual method following the algorithm as described
,       // on p. 24 in the SIAM Templates book.
,       //
,       //   -------------------------------------------------------------
,       //   return value     indicates
,       //   ------------     ---------------------
size    4089 kb

```