24.02.2014 Views

Partial Differential Equations - Modelling and ... - ResearchGate

Partial Differential Equations - Modelling and ... - ResearchGate

Partial Differential Equations - Modelling and ... - ResearchGate

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Domain Decomposition Approach for Computational Chemistry 159<br />

Table 1. Localization parameters, block sizes <strong>and</strong> asymptotic gaps for the test cases.<br />

P 1 P 2 P 3<br />

B<strong>and</strong>width of S 59 79 111<br />

B<strong>and</strong>width of H 99 159 255<br />

n 130 200 308<br />

q 50 80 126<br />

Asymptotic gap (a.u.) 1.04 × 10 −3 3.57 × 10 −3 2.81 × 10 −2<br />

molecules can then be constructed using this periodicity property. For n m<br />

sufficiently large, bulk periodicity is also observed in the density matrix. This<br />

property is used to generate reference solutions for large molecules.<br />

Table 1 gives a synthetic view of the different structure properties of the<br />

three families of matrices under examination. The integer q st<strong>and</strong>s for the<br />

overlap between two adjacent blocks (note that one could have taken n =2q<br />

if the overlap matrix S was equal to identity, but that one has to take n>2q<br />

in our case since S ≠ I).<br />

Initial guess generation is of crucial importance for any linear scaling<br />

method. The procedure in use here is in the spirit of the domain decomposition<br />

method:<br />

1. A first guess of the block sizes is obtained by locating Z electrons around<br />

each nucleus of charge Z;<br />

2. A set of blocks C i is built from the lowest m i (generalized) eigenvectors<br />

associated with the block matrices H i <strong>and</strong> S i (the block matrices H i are<br />

introduced in Section 2; the block matrices S i are defined accordingly);<br />

3. These blocks are eventually optimized with the local fine solver of the<br />

MDD algorithm, including block size update (electron transfer).<br />

Criteria for comparing the results<br />

The quality of the results produced by the MDD <strong>and</strong> DMM methods is evaluated<br />

by computing two criteria. The first criterion is the relative energy<br />

difference e E = |E−E0|<br />

|E 0|<br />

between the energy E of the current iterate D <strong>and</strong><br />

the energy E 0 of the reference density matrix D ⋆ . The second criterion is the<br />

semi-norm<br />

∣<br />

∣<br />

∣∣<br />

e ∞ = sup ∣D ij − [D ⋆ ] ij (21)<br />

(i,j) s.t. |H ij|≥ε<br />

with ε =10 −10 . The introduction of the semi-norm (21) is consistent with<br />

the cut-off on the entries of H (thus the value chosen for ε). Indeed, in most<br />

cases, the matrix D is only used for the calculations of various observables<br />

(in particular the electronic energy <strong>and</strong> the Hellman–Feynman forces), all of<br />

them of the form Tr(AD), where the matrix A shares the same pattern as<br />

H (see [CDK + 03] for details). The final result of the calculation is, therefore,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!