First Derivative Approximations

Table A.3 First derivative approximations uj (ri) for atbitrarily spaced n points (n - 3,4) at positions xi. .. x , each point at an offset hi = x k) — x(i) with respect to the reference point at index i...

To see why upwind differencing works, we relate the upwind and central difference first-derivative approximations through the identity... 

The most important classes of functionalized [60]fullerene derivatives, e.g. methanofullerenes [341, pyrrolidinofullerenes [35], Diels-Alder adducts [34i] and aziridinofullerene [36], all give rise to a cancellation of the fivefold degeneration of their HOMO and tlireefold degeneration of their LUMO levels (figure Cl.2.5). This stems in a first order approximation from a perturbation of the fullerene s 7i-electron system in combination with a partial loss of the delocalization. 

Another method for finding the end point is to plot the first or second derivative of the titration curve. The slope of a titration curve reaches its maximum value at the inflection point. The first derivative of a titration curve, therefore, shows a separate peak for each end point. The first derivative is approximated as ApH/AV, where ApH is the change in pH between successive additions of titrant. For example, the initial point in the first derivative titration curve for the data in Table 9.5 is... 

The second derivative of a titration curve may be more useful than the first derivative, since the end point is indicated by its intersection with the volume axis. The second derivative is approximated as A(ApH/AV)/AV, or A pH/AV. For the titration data in Table 9.5, the initial point in the second derivative titration curve is... 

There are some systems for which the default optimization procedure may not succeed on its own. A common problem with many difficult cases is that the force constants estimated by the optimization procedure differ substantially from the actual values. By default, a geometry optimization starts with an initial guess for the second derivative matrix derived from a simple valence force field. The approximate matrix is improved at each step of the optimization using the computed first derivatives. 

In such cases the expression from fii st-order perturbation theory (10.18) yields a result identical to the first derivative of the energy with respect to A. For wave functions which are not completely optimized with respect to all parameters (Cl, MP or CC), the Hellmann-Feynman theorem does not hold, and a first-order property calculated as an expectation value will not be identical to that obtained as an energy derivative. Since the Hellmann-Feynman theorem holds for an exact wave function, the difference between the two values becomes smaller as the quality of an approximate wave function increases however, for practical applications the difference is not negligible. It has been argued that the derivative technique resembles the physical experiment more, and consequently formula (10.21) should be preferred over (10.18). 

Before we discuss the merits of kss versus kpe, we shall consider one other approximate solution. Some authors refer to it as the improved steady-state solution. 2 We shall present two derivations. In the first, the approximation for d[ ]/dt is refined by differentiating the steady-state expression for [I]ss, which gives... 

Another technique consists of MC measurements during potential modulation. In this case the MC change is measured synchronously with the potential change at an electrode/electrolyte interface and recorded. To a first approximation this information is equivalent to a first derivative of the just-explained MC-potential curve. However, the signals obtained will depend on the frequency of modulation, since it will influence the charge carrier profiles in the space charge layer of the semiconductor. 

Convergence order At for Euler s method is based on more than the empirical observation in Example 2.4. The order of convergence springs directly from the way in which the derivatives in Equations (2.11) are calculated. The simplest approximation of a first derivative is... 

This approximation is called a forward difference since it involves the forward point, z + Az, as well as the central point, z. (See Appendix 8.2 for a discussion of finite difference approximations.) Equation (8.16) is the simplest finite difference approximation for a first derivative. 

The concentration at the wall, a(7), is found by applying the zero flux boundary condition. Equation (8.14). A simple way is to set a(I) = a(I — 1) since this gives a zero first derivative. However, this approximation to a first derivative converges only 0(Ar) while all the other approximations converge O(Ar ). A better way is to use... 

---