4. Parameters and Configurations¶
4.1. General Parameters¶
Parameter |
Description |
Suggested value |
Default value |
---|---|---|---|
|
Rank of the matrix \(A\). |
N/A |
|
|
Number of desired eigenpairs |
No more than 20% of the total number of eigenvalues (or rank of \(A\)) |
N/A |
|
Search space increment
such that the overall
size of the search space
is |
In most cases 20% of
the value of
|
N/A |
|
An optional flag indicating whether the user provides ChASE with approximate eigenvectors or uses ChASE in isolation as a traditional black-box solver |
When |
(black-box solver) |
|
An optional parameter indicating the minimal value for the residual such that the corresponding eigenpair is declared converged. |
As a rule of thumb a
minimum value of
|
|
|
An optional parameter set
as to avoid that ChASE
internal while loop runs
unchecked in the rare
cases where convergence
of the desired eigenpairs
cannot be secured. Once
reached the
|
Typically ChASE does not need more than 10 iterations even in the most complex cases and averages 4-5 iterations to convergence. |
|
4.2. Chebyshev Filter¶
Parameter |
Description |
Suggested value |
Default value |
---|---|---|---|
|
Polynomial degree for the
Chebyshev filter. When
the value of
|
When
|
|
|
An optional flag indicating that the filter uses a vector of degrees optimized for each single filtered vector. |
Despite the fact that
the default value is
set to |
|
|
A small value used only
in combination with
|
Usually a small number
never larger than |
|
|
A parameter which avoids that vectors with a rather small convergence ratio get overfiltered entering in a regime of numerical instability. |
This value is a result
of practice and
experience. We suggest
to avoid setting it
below |
|
4.3. Lanczos DoS (Spectral Estimator)¶
Parameter |
Description |
Suggested value |
Default value |
---|---|---|---|
|
In order to estimate the spectral bounds, ChASE executes a limited number of Lanczos steps. These steps are then used to compute an estimate of \(\lambda_1\), \(\lambda_{nev+nex}\), and \(\lambda_N\) based on the Density of State (DoS) algorithm. |
ChASE does not need very
precise spectral
estimates because at
each iteration such
estimates are
automatically
improved by the
approximate spectrum
computed. For the DoS
algorithm to work
effectively without
overburdening the
eigensolver, the number
of Lanczos iteration
should be not less than
|
|
|
After having executed a number
of Lanczos steps, ChASE uses a
cheap and efficient estimator
to calculate the value of the
upper extremum of the search space.
Such an estimator uses a small
number of stochastic vectors
indicated by the variable
|
Because ChASE does not
need precise estimates
of the upper extremum
of the search space,
the number of vectors
used is quite small.
The expert user can
can change the value
to a larger number than
the default value (it
is not suggested to
use a smaller value)
and pay a higher
computing cost. It is
suggested to not
set a value for
|
|