next up previous contents index
Next: Block Size. Up: Block Arnoldi Method   Previous: Block Arnoldi Reductions   Contents   Index

Practical Algorithm

Algorithm 7.12 lists a generic block implicitly restarted Arnoldi method (BIRAM). The remainder of this section discusses some of the implementation issues necessary for a robust software implementation. In particular, we address the issues of block size ($b$), convergence considerations, deflation, implicit restarting, and the selection of shifts and choice of $p$.


\begin{algorithm}
% latex2html id marker 23883
{BIRAM for NHEP
}
{
\begin{tabb...
...ngth $r$\ block Arnoldi \\
\> \> \> reduction.
\end{tabbing}}
\end{algorithm}



Subsections

Susan Blackford 2000-11-20