next up previous contents index
Next: References Up: Determinant-Based CI Previous: Olsen's Full CI Equations

Full CI Algorithm

It is easy to vectorize the formation of tex2html_wrap_inline4392 since each element tex2html_wrap_inline4452 can be written as independent of tex2html_wrap_inline4173 apart from multiplication by a factor tex2html_wrap_inline4436. The vectorized algorithm for the evaluation of tex2html_wrap_inline4392, adapted from reference [17], appears in Figure 5. An analogous algorithm can be used to obtain tex2html_wrap_inline4394. However, we can also obtain tex2html_wrap_inline4394 for tex2html_wrap_inline3825 states by
 equation2264
as proven by Olsen   and co-workers [17].

  figure2274
Figure 7: Vectorized Algorithm for tex2html_wrap_inline4392.

A fairly straightforward algorithm for evaluating tex2html_wrap_inline4396 is presented in Figure 6. The vectorized algorithm for the evaluation of tex2html_wrap_inline4396 is presented in Figure 7. This algorithm makes use of a gather and scatter operation to avoid indirect addressing.

  figure2334
Figure 6: Simple Algorithm for tex2html_wrap_inline4396.

  figure2364
Figure: Vectorized Algorithm for tex2html_wrap_inline4396.

For tex2html_wrap_inline3825, an improvement to the tex2html_wrap_inline4396 algorithm can be made by utilizing an identity similar to equation (6.31). The ijklth component of tex2html_wrap_inline4396 is related to the klijth component via
equation2412

 



CCQC WWW repository
Thu Aug 14 12:57:45 EDT 1997