NAG Library Routine Document
F12FAF
1 Purpose
F12FAF is a setup routine in a suite of routines consisting of F12FAF,
F12FBF,
F12FCF,
F12FDF and
F12FEF. It is used to find some of the eigenvalues (and optionally the corresponding eigenvectors) of a standard or generalized eigenvalue problem defined by real symmetric matrices.
The suite of routines is suitable for the solution of large sparse, standard or generalized, symmetric eigenproblems where only a few eigenvalues from a selected range of the spectrum are required.
2 Specification
INTEGER 
N, NEV, NCV, ICOMM(max(1,LICOMM)), LICOMM, LCOMM, IFAIL 
REAL (KIND=nag_wp) 
COMM(max(1,LCOMM)) 

3 Description
The suite of routines is designed to calculate some of the eigenvalues, $\lambda $, (and optionally the corresponding eigenvectors, $x$) of a standard eigenvalue problem $Ax=\lambda x$, or of a generalized eigenvalue problem $Ax=\lambda Bx$ of order $n$, where $n$ is large and the coefficient matrices $A$ and $B$ are sparse, real and symmetric. The suite can also be used to find selected eigenvalues/eigenvectors of smaller scale dense, real and symmetric problems.
F12FAF is a setup routine which must be called before
F12FBF, the reverse communication iterative solver, and before
F12FDF, the options setting routine.
F12FCF, is a postprocessing routine that must be called following a successful final exit from
F12FBF, while
F12FEF can be used to return additional monitoring information during the computation.
This setup routine initializes the communication arrays, sets (to their default values) all options that can be set by you via the option setting routine
F12FDF, and checks that the lengths of the communication arrays as passed by you are of sufficient length. For details of the options available and how to set them see
Section 10.1 in F12FDF.
4 References
Lehoucq R B (2001) Implicitly restarted Arnoldi methods and subspace iteration SIAM Journal on Matrix Analysis and Applications 23 551–562
Lehoucq R B and Scott J A (1996) An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices Preprint MCSP5471195 Argonne National Laboratory
Lehoucq R B and Sorensen D C (1996) Deflation techniques for an implicitly restarted Arnoldi iteration SIAM Journal on Matrix Analysis and Applications 17 789–821
Lehoucq R B, Sorensen D C and Yang C (1998) ARPACK Users' Guide: Solution of Largescale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods SIAM, Philidelphia
5 Parameters
 1: N – INTEGERInput
On entry: the order of the matrix $A$ (and the order of the matrix $B$ for the generalized problem) that defines the eigenvalue problem.
Constraint:
${\mathbf{N}}>0$.
 2: NEV – INTEGERInput
On entry: the number of eigenvalues to be computed.
Constraint:
$0<{\mathbf{NEV}}<{\mathbf{N}}1$.
 3: NCV – INTEGERInput
On entry: the number of Lanczos basis vectors to use during the computation.
At present there is no
a priori analysis to guide the selection of
NCV relative to
NEV. However, it is recommended that
${\mathbf{NCV}}\ge 2\times {\mathbf{NEV}}+1$. If many problems of the same type are to be solved, you should experiment with increasing
NCV while keeping
NEV fixed for a given test problem. This will usually decrease the required number of matrixvector operations but it also increases the work and storage required to maintain the orthogonal basis vectors. The optimal ‘crossover’ with respect to CPU time is problem dependent and must be determined empirically.
Constraint:
${\mathbf{NEV}}<{\mathbf{NCV}}\le {\mathbf{N}}$.
 4: ICOMM($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LICOMM}}\right)$) – INTEGER arrayCommunication Array
On exit: contains data to be communicated to the other routines in the suite.
 5: LICOMM – INTEGERInput
On entry: the dimension of the array
ICOMM as declared in the (sub)program from which F12FAF is called.
If
${\mathbf{LICOMM}}=1$, a workspace query is assumed and the routine only calculates the required dimensions of
ICOMM and
COMM, which it returns in
${\mathbf{ICOMM}}\left(1\right)$ and
${\mathbf{COMM}}\left(1\right)$ respectively.
Constraint:
${\mathbf{LICOMM}}\ge 140\text{ or}{\mathbf{LICOMM}}=1$.
 6: COMM($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LCOMM}}\right)$) – REAL (KIND=nag_wp) arrayCommunication Array
On exit: contains data to be communicated to the other routines in the suite.
 7: LCOMM – INTEGERInput
On entry: the dimension of the array
COMM as declared in the (sub)program from which F12FAF is called.
If
${\mathbf{LCOMM}}=1$, a workspace query is assumed and the routine only calculates the dimensions of
ICOMM and
COMM required by
F12FBF, which it returns in
${\mathbf{ICOMM}}\left(1\right)$ and
${\mathbf{COMM}}\left(1\right)$ respectively.
Constraint:
${\mathbf{LCOMM}}\ge 3\times {\mathbf{N}}+{\mathbf{NCV}}\times {\mathbf{NCV}}+8\times {\mathbf{NCV}}+60\text{ or}{\mathbf{LCOMM}}=1$.
 8: IFAIL – INTEGERInput/Output

On entry:
IFAIL must be set to
$0$,
$1\text{ or}1$. If you are unfamiliar with this parameter you should refer to
Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{ or}1$ is recommended. If the output of error messages is undesirable, then the value
$1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is
$0$.
When the value $\mathbf{1}\text{ or}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit:
${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6 Error Indicators and Warnings
If on entry
${\mathbf{IFAIL}}={\mathbf{0}}$ or
${{\mathbf{1}}}$, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
Errors or warnings detected by the routine:
 ${\mathbf{IFAIL}}=1$
On entry, ${\mathbf{N}}\le 0$.
 ${\mathbf{IFAIL}}=2$
On entry, ${\mathbf{NEV}}\le 0$.
 ${\mathbf{IFAIL}}=3$
On entry, ${\mathbf{NCV}}\le {\mathbf{NEV}}$ or ${\mathbf{NCV}}>{\mathbf{N}}$.
 ${\mathbf{IFAIL}}=4$
On entry, ${\mathbf{LICOMM}}<140$ and ${\mathbf{LICOMM}}\ne 1$.
 ${\mathbf{IFAIL}}=5$
On entry, ${\mathbf{LCOMM}}<3\times {\mathbf{N}}+{\mathbf{NCV}}\times {\mathbf{NCV}}+8\times {\mathbf{NCV}}+60$ and ${\mathbf{LCOMM}}\ne 1$.
7 Accuracy
Not applicable.
None.
9 Example
This example solves $Ax=\lambda x$ in regular mode, where $A$ is obtained from the standard central difference discretization of the Laplacian operator $\frac{{\partial}^{2}u}{\partial {x}^{2}}+\frac{{\partial}^{2}u}{\partial {y}^{2}}$ on the unit square, with zero Dirichlet boundary conditions. Eigenvalues of smallest magnitude are selected.
9.1 Program Text
Program Text (f12fafe.f90)
9.2 Program Data
Program Data (f12fafe.d)
9.3 Program Results
Program Results (f12fafe.r)