only
is the same as described above.
$maxcor
specifies only the memory used to store derivatives of density
and Fock matrices as well as the CPHF-RHS.
Default is 200MB.
$isosub 3 2.001 5 13 |
$les all 1
means that one lowest eigenvalue for each irrep
will be determined, other numbers of lowest eigenvalues per irrep
are admissible too.
Different numbers of lowest eigenvalues for different irreps are requested by e.g.
$les
a1 3
a2 all
b2 1
The convergence criterion of the Davidson iterations for the solution of the CPHF-equations as well as the maximal residual norm for the lowest Hessian eigenvalue in the macro-iteration are specified by $forceconv as explained above.
The maximum number of macro-iterations is specified by $lesiterlimit x
with the default x
=25.
The maximum number of iterations for each solution
of the CPHF-equations is again determined by $forceiterlimit as
shown above.
The convergence of the macro-iterations is strongly influenced by the size
of the starting search-subspace. Generally all guess-Hessian eigenvectors
corresponding to imaginary frequencies and at least two real ones are used
as starting search-subspace. However it proved to be necessary to use even
more vectors in the case of guess-Hessians with very large conditioning
numbers.
$hesscond 8.0d-5
means that all eigenvalues with the quotient
(eigenvalue)/(max. eigenvalue) lower than 0.00008 are added to the starting
search-subspace. Default is 1.0d-4.
Force constant calculations on the DFT level prove to be
numerically reliable only with large integration grids or
if one includes the effects of quadrature weights.
This is done by default--to prevent this, insert
no weight derivatives
in $dft.