Next: Matrix Preparation.
Up: Introduction
Previous: Overview of Available Algorithms.
  Contents
  Index
In Table
4.1, we have listed the above algorithms
and added some information that may be helpful
to decide which algorithm to use in a specific situation.
Table 4.1:
Summary of algorithms for HEPs
| |
Appl |
Orth |
IE |
CE |
M |
# vec |
Fact |
| Power |
Dir |
|
Yes |
Very slow |
No |
2 |
- |
| |
SI |
|
- |
Yes |
Yes |
2 |
LU |
| Subspace iter |
Dir |
FO |
Yes |
Slow |
No |
Moderate |
- |
| |
SI |
FO |
- |
Yes |
Yes |
Moderate |
LU |
| Lanczos |
Dir |
local |
Yes |
No |
No |
3 |
- |
| |
Dir |
SO |
Yes |
Slow |
No |
Many |
- |
| |
SI |
FO |
- |
Yes |
Yes |
Moderate |
LU |
| IR Lanczos |
Dir |
FO |
Yes |
Slow |
No |
Few |
- |
| |
SI |
FO |
- |
Yes |
Yes |
Fewer |
LU |
| Band |
Dir |
FO |
Yes |
Yes |
No |
Many |
- |
| Lanczos |
SI |
FO |
- |
Yes |
Yes |
Moderate |
LU |
| Jac-Dav |
Dir |
FO |
Slow |
Slow |
No |
Few |
- |
| |
Prec |
FO |
Yes |
Yes |
Slow |
Few |
ILU |
| |
SI |
FO |
- |
Yes |
Yes |
Few |
LU |
Next: Matrix Preparation.
Up: Introduction
Previous: Overview of Available Algorithms.
  Contents
  Index
Susan Blackford
2000-11-20