Professional Documents
Culture Documents
2.HOW ACCURATELY?
Search in the literature for the
last information in a subject
2. HOW ACCURATELY?
For example, compare experimental with computational chemistry
ERROR
SUBJECT OPERATION ESTIMATION
Analytical chemistry
Standard deviation
Repetition of measurements
Computational chemistry
Practically
same results!
with the exception
of Monte Carlo
calculations.
Compare with
•Experimental answers or
•More rigorous computations
2. HOW ACCURATELY?
What do I want to consider?
for example…
•Should I add a zero point energy (ZPE)
correction?
•type of calculation
•basis sets
•ECPs
•force fields
2. HOW ACCURATELY?
In a imperfect world…
incore algorithm
stores all the integrals in RAM memory thus saving on disk space at the
expense of requiring a computer with a very large amount of memory.
semidirect algorithm
which uses some disk space
and a bit more CPU time to obtain the optimal balance of both.
TIME COMPLEXITY
(how the use of computer resources (CPU, time, memory, etc.) changes
as the size of the problem changes)
At the end of the calculation, the orbital energies must be added. Since
there are N orbitals, there will be N addition operations.
Topt ≈ 5 x D2 x Tsingle
Example
But be careful…
vibrational frequencies must be computed with the same level of theory
used to optimize the geometry.
1. Examines the literature to determine that an ab initio method with a
moderately large basis set will give the desired accuracy of results.
10.feasible since she has her own work station with an uninterruptible
power supply.
Labor cost
(labor necessary on the part of the user)
than
that could be
done by a workstation with different software.
PARALLEL COMPUTERS
And
compilers are usually inefficient for sophisticated computer programs.
Some software packages can be run on a networked cluster of
workstations as though they were a multiple-processor
machine.
However,
the speed of data transfer across a network is not as fast as the speed
of data transfer between the CPUs of a parallel computer.
(Fine-grained algorithms)
large-grained algorithms
Some algorithms break down the work to be done into very large
chunks with a minimal amount of communication between processors
•Note that two programs of the same type (i.e., ab initio) may calculate
diferent properties so the user must make sure the program does exactly
what is needed.
http://www3.interscience.wiley.com/cgi-bin/booktoc/93517240