A discontinuous Galerkin scheme for full-potential electronic structure calculations
Xiaoxu Li, Huajie Chen

TL;DR
This paper introduces an efficient discontinuous Galerkin scheme for full-potential electronic structure calculations, combining different basis functions in atomic and interstitial regions with spectral convergence.
Contribution
It develops a novel DG-based numerical scheme with spectral convergence for periodic electronic structure calculations, inspired by (L)APW methods.
Findings
Scheme achieves spectral convergence rate
Provides rigorous a priori error analysis
Demonstrates effectiveness through numerical simulations
Abstract
In this paper, we construct an efficient numerical scheme for full-potential electronic structure calculations of periodic systems. In this scheme, the computational domain is decomposed into a set of atomic spheres and an interstitial region, and different basis functions are used in different regions: radial basis functions times spherical harmonics in the atomic spheres and plane waves in the interstitial region. These parts are then patched together by discontinuous Galerkin (DG) method. Our scheme has the same philosophy as the widely used (L)APW methods in materials science, but possesses systematically spectral convergence rate. We provide a rigorous a priori error analysis of the DG approximations for the linear eigenvalue problems, and present some numerical simulations in electronic structure calculations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A discontinuous Galerkin scheme for full-potential electronic structure calculations
Xiaoxu Li
and Huajie Chen
School of Mathematical Sciences, Beijing Normal University, No.19 Xinjiekouwai Street, Beijing, 100875, P.R.China. E-mail: [email protected]. Xiaoxu Li’s work was partially supported by the National Science Foundation for Young Scientists of China under Grant 11701037. School of Mathematical Sciences, Beijing Normal University, No.19 Xinjiekouwai Street, Beijing, 100875, P.R.China. E-mail: [email protected]. Huajie Chen’s work was partially supported by the Fundamental Research Funds for the Central Universities of China under Grant 2017EYT22.
Abstract
In this paper, we construct an efficient numerical scheme for full-potential electronic structure calculations of periodic systems. In this scheme, the computational domain is decomposed into a set of atomic spheres and an interstitial region, and different basis functions are used in different regions: radial basis functions times spherical harmonics in the atomic spheres and plane waves in the interstitial region. These parts are then patched together by discontinuous Galerkin (DG) method. Our scheme has the same philosophy as the widely used (L)APW methods in materials science, but possesses systematically spectral convergence rate. We provide a rigorous a priori error analysis of the DG approximations for the linear eigenvalue problems, and present some numerical simulations in electronic structure calculations.
1 Introduction
Electronic structure calculations describe the energies and distributions of electrons, which plays a fundamental role in many different fields: materials science, biochemistry, solid-state physics, and surface physics. Among different electronic structure models, the Kohn-Sham density functional theory (DFT) [34] so far achieves the best compromise between accuracy and computational cost. For an -electron system with the presence of nuclei of charge and located at , Kohn-Sham DFT gives rise to the following nonlinear eigenvalue problems
[TABLE]
with and the Kohn-Sham Hamiltonian
[TABLE]
Here, is the external potential generated by nuclear attraction, and are the so-called Hartree potential and exchange-correlation potential, respectively, with the electron density . A self-consistent field (SCF) iteration algorithm is commonly resorted to for these nonlinear problems. In each iteration, a Hamiltonian is constructed from a trial electronic state , and a linear eigenvalue problem is then solved to obtain the low-lying eigenvalues and corresponding eigenfunctions. The loop continues until self-consistency of the electronic states is achieved. The efficiency of the algorithm is mainly determined by the discretization of the Hamiltonian, the self-consistent iteration, and the linear eigensolver. We shall focus ourselves on the discretization method in this paper.
For periodic systems, plane waves with pseudopotentials are natural methods which are simple to implement and give relatively accurate simulations. The pseudopotential approximations [34] replace singular nuclear attraction potential and complicated effects of the motion of core electrons by a smooth potential. They give satisfactory results in most cases, but sometimes fail. The mathematical analysis of the pseudopotential approximations is very rare, and we refer to [8, 14] for two recent works. Moreover, the core electrons have to be considered sometimes and are responsible for many properties. Therefore, the full-potential/all-electron calculations are necessary.
For eigenvalue problems with singular potentials in full-potential calculations, plane waves are inefficient bases for describing the cusps at the nuclei positions [23, 24, 25, 28]. In contrast, it is observed that a significant part of the rapid oscillations can be captured by atomic orbitals such as Gaussians and Slater-type orbitals [27, 34], which have been widely used in quantum chemistry (we refer to [7, 18] for their numerical analysis). Therefore, it would be practically efficient to approximate the wavefunction in a crystal by using combinations of plane waves and appropriate atomic orbitals. Several computational methods using this idea have been developed, for example, augmented plane waves (APW) [38, 40], linearized augmented plane waves (LAPW) [38], and their extensions by including local orbitals (lo), LAPW+lo methods [33, 37, 39]. Exploiting the idea of constructing basis functions for different domains separately, we construct a numerical scheme in this paper. The smoothly varying parts of the wavefunctions away from the atoms are represented by plane waves, the rapidly varying parts near the nuclei are represented by radial basis functions times spherical harmonics, and the approximations inside and outside the spheres are patched together by DG methods.
The DG framework has been widely used in numerical solutions of partial differential equations and investigated theoretically in a lot of works (see, e.g., [3, 6, 11, 26, 41] and references cited therein). For electronic structure calculations, we refer to works by Lin et al. [31, 42], which constructs basis functions adaptively from the local environment and patches them together in global domain by DG methods.
We further present an a priori error analysis of our DG approximations for the linear eigenvalue problems. Thanks to the asymptotic regularity result developed by Flad et al. [22], we can guarantee smoothness of the wavefunctions on the domain in spherical coordinates. Our analysis for DG approximations is also closely related to the technique used in [1, 26, 36, 41]. The main theoretical result in this paper is the following superalgebraic convergence rate under certain assumptions (see Theorem 3.1):
[TABLE]
where can be arbitrarily small, denotes the discretization parameters (see (3.1)), and the constant depends only on and the eigenfunctions.
We shall briefly compare our DG method with other existing full-potential/all-electron methods in electronic structure calculations. (a) APW: The augmented plane wave (APW) method [40] introduces basis functions that are plane waves in the interstitial region and radial solutions of Schrödinger equations inside the atomic spheres. A great disadvantage of the APW method is that the basis functions are energy dependent, which results in a nonlinear eigenvalue problem and must be solved separately for each eigenstate by “root tracing” technique [34] or iteration methods. This method is much more complicated to solve than the straightforward linear eigenvalue equations expressed with a fixed basis set, such as plane waves, Gaussians, LAPW (in the following), and our DG schemes. (b) LAPW (+lo): The linearized augmented plane wave (LAPW) method [34, 38] is a linearization of APW, which defines basis functions as linear combinations of a radial solution and its energy derivative evaluated at a chosen fixed energy. This forms a basis set adapted to a particular system that is suitable for calculation of all states in an energy “window”. The accuracy depends heavily on the choice of energy parameter and the width of the energy window under consideration. Although the inclusion of additional variational freedoms (the energy derivatives and sometimes local orbitals (lo) [38]) in the LAPW method facilitates the computation for non-spherical symmetric parts of the potential, there is no proof that it can give solutions of arbitrarily great accuracy for general potentials as our DG scheme. Here we would like to mention a recent work [20] which uses similar ideas as LAPW+lo and may possess systematical convergence. (c) OPW: The orthogonalized plane wave (OPW) method [27] constructs basis functions by orthogonalizing the plane waves to special local functions around each nucleus. The ambiguity of this method arises from inaccuracies of the core wave functions, which are not precise eigenfunctions of the given Hamiltonian. Thus, there is always an uncertainty about the accuracy of OPW results which can not be refined out by more extended calculations. (d) PAW/VPAW: The projector augmented wave (PAW) method [9] replaces the original eigenvalue problem (with singular potential) by a new one with the same eigenvalues but smoother eigenvectors. A slightly different method, called variational projector augmented wave (VPAW), was proposed and analyzed recently [8]. This new method allows for a better convergence with respect to the number of plane waves. But we mention that the PAW method is more of a pseudopotential method.
The rest part of this paper is organized as follows. In Section 2, we set up the model problem and present some regularity results. In Section 3, we introduce a DG discretization scheme, provide a numerical analysis of the convergence and a priori error estimates of the DG approximations. In Section 4, we give some details of the numerical implementations and present some numerical experiments to support our theory. Finally, we give some concluding remarks.
2 Preliminary
Throughout this paper, we shall use to denote a generic positive constant which may stand for different values at its different occurrences and is independent of finite dimensional subspaces. For convenience, the symbol will be used and the notation means that for some generic positive constant .
Let be a discrete periodic lattice of , be the unit cell of the lattice, and be the dual lattice. For simplicity, we take , , and .
For , we denote by the plane wave with wavevector . The family forms an orthonormal basis set of
[TABLE]
For all , we have
[TABLE]
We introduce the Sobolev spaces of -periodic functions
[TABLE]
with . For , we denote the finite dimensional subspace by
[TABLE]
For , the best approximation of in is for any -norm (). The more regularity has, the faster this truncated series converge to : For real numbers and satisfying , we have that for each ,
[TABLE]
As a model problem, we consider the following Schrödinger-type linear eigenvalue problem, which can be viewed as a linearization of (1.1): Find and such that and
[TABLE]
where the bilinear form is given by
[TABLE]
with a -periodic potential .
To represent the wavefunctions separately in different regions, is divided into atomic spheres and an interstitial region (see Figure 2.1 (left) for decomposition of a single-atom system, and Figure 2.1 (right) for similar construction of a two-atom system).
For sake of simplicity, we shall restrict our discussions to a single atom located at the origin, the algorithms and analysis of which can be easily generalized to multi-atom systems. Throughout this paper, we shall denote by the interstitial region, by the sphere centered at the origin with radius , and by the spherical surface. We also assume throughout this paper that the potential equals to in the neighborhood of , and belongs to .
It was shown in [23, 24, 25] that the exact electron densities are analytic away from the nuclei and satisfy certain cusp conditions at the nuclei. The plane wave approximations can not have as good convergence rate as (2.1) due to the cusps at the nuclear positions. The following lemma concerning the regularity of eigenfunctions of (2.2) is heavily used in our analysis, the proof of which can be referred to [22, Theorem 1,4 and Proposition 1].
Lemma 2.1**.**
If is an eigenfunction of (2.2), then for any .
The following lemma states the relationship between two Sobolev norms.
Lemma 2.2**.**
If , then there exits a constant depending on such that
[TABLE]
Proof.
Note that in spherical coordinates
[TABLE]
where the last two terms multiplied by is the total angular momentum operator on spherical surface, i.e. the Laplace-Beltrami operator.
Since implies
[TABLE]
we have
[TABLE]
where Green’s formula and (2.4) are used for the second equality. ∎
3 DG discretization
In this section, we construct a DG discretization scheme using radial basis functions times spherical harmonics inside the sphere and plane waves outside. We provide an a priori error analysis of the numerical approximations. Our analysis is composed of three steps: first, we estimate the best approximation errors inside and outside the sphere separately; then we give an error estimate for the DG approximation of the corresponding source problem; finally, we derive an error estimate for the eigenvalue problem. Note that the errors generated by numerical quadratures and linear algebraic solvers are not considered in this paper, which deserve separate investigations.
Note that if is an eigenfunction of (2.2), then we have from Lemma 2.1 that for any , in spherical coordinates and . We can therefore introduce the following space
[TABLE]
with induced norm
[TABLE]
3.1 Approximation space
Denote by the space of functions on expanded by plane waves
[TABLE]
and by the space of functions on expanded by radial basis functions times spherical harmonics
[TABLE]
where are basis functions on . Here, we denote by the spherical coordinate representations of the function , i.e., .
For simplicity, we may assume that the radial basis functions are polynomials that span the space of all polynomials of degree no greater than .
Remark 3.1**.**
There are many choices of the radial basis functions . One can use spectral methods, such as Legendre polynomials, Chebyshev polynomials and Jacobi polynomials, et al. These types of functions form a complete basis set on , and possess spectral convergence rates for any sufficiently smooth function [15].
Another type of basis set is atomic orbitals [30, 34], such as Gaussians, Slater-type orbitals and numerical solutions of radial Schrödinger equations [30, 34]. These basis functions are closely related to physical problems, and can be very efficient in practice. In some cases, we can rigorously derive their convergence rates [7, 18].
For simplicity of presentations, we shall focus our analysis on the polynomial-type radial basis functions and investigate the atomic orbitals as well in numerical experiments.
Define the finite dimensional space
[TABLE]
Throughout this paper, we may assume that there exists a constant such that
[TABLE]
which can denote the discretization parameters.
In the following, we shall define some “best” approximations of the function in the interstitial region and atomic spheres respectively.
For the interstitial region, we define the projections satisfying
[TABLE]
Proposition 3.1**.**
If , then for , there exists a constant such that
[TABLE]
Proof.
The proof is similar to that of [19, Proof of Lemma 3.1]. We keep this proof for sake of completeness.
We shall first extend the function smoothly into the sphere. The wavefunction around the sphere can be represented by
[TABLE]
with , where we use spherical coordinates to express for spherical harmonics on . Then we can define
[TABLE]
where with , satisfying on and on . We observe that leads to and moreover
[TABLE]
where the constant is only related to and . Let
[TABLE]
we have from (3.6) that
[TABLE]
which completes the proof of (3.2). ∎
For the atomic spheres, we define satisfying
[TABLE]
and satisfying
[TABLE]
For and , we have the following standard estimates (see, e.g., [4, 32])
[TABLE]
for any and . Define the projection by , we have that for , and ,
[TABLE]
Proposition 3.2**.**
If , then for and any , there exists a constant such that
[TABLE]
Proof.
Using (3.7) and Lemma 2.2, we have
[TABLE]
which completes the proof. ∎
3.2 DG approximations of the source problem
We shall discuss the DG discretization for the source problem and our analysis is related to the framework in [1].
For vector-valued and scalar-valued function which are not continuous on the spherical surface , we define the jumps by
[TABLE]
and the averages by
[TABLE]
where and are traces of and on taken from inside and outside the sphere, are the normal unit vectors.
Since is a finite dimensional space, there exists a constant depending on such that the following inverse estimate holds
[TABLE]
In our analysis, we assume
[TABLE]
We are not able to justify (3.10) rigorously, however, we provide some numerical experiments in Appendix A to show that it could be true. Then we get from the “interpolation” arguments (see Appendix A) that
[TABLE]
for some .
We then define the bilinear form by
[TABLE]
where is the discontinuity-penalization parameter with a constant independent of the discretization.
Note that there are many other types of DG formulations (see, e.g., [1, 3]), and (3.12) is the classical symmetric interior penalty (SIP) method [1, 2, 31].
We further define the broken Sobolev space
[TABLE]
equipped with the following DG-norm
[TABLE]
Lemma 3.1**.**
If is sufficiently large, then there exist constants such that
[TABLE]
Proof.
Using Hölder inequality, Sobolev’s embedding theorem and Young’s inequality, we obtain that
[TABLE]
where is arbitrarily small. Hence we have
[TABLE]
with constants . Moreover, we have
[TABLE]
Using (3.9), (3.15) and (3.16), we can derive (3.14) and complete the proof. ∎
For simplicity, we can take . Note that makes this true for .
Define the solution operators
[TABLE]
and
[TABLE]
Proposition 3.3**.**
Assume that (3.10) is true and is sufficiently large. If for and , then there exists a constant such that
[TABLE]
Proof.
Denote and . Define the projection , We decompose the error as , where and . With simple calculations, we can easily obtain that , which leads to the property that . Using (3.14) and the property, we have
[TABLE]
Thus we deduce that
[TABLE]
where
[TABLE]
Since , we have
[TABLE]
Using the trace inequality, can be estimated by
[TABLE]
Similarly, can be estimated by
[TABLE]
Collecting (3.18) and the error bounds (3.19) to (3.21), we have
[TABLE]
We obtain from (3.2) and (3.8) that if , then
[TABLE]
which together with
[TABLE]
leads to
[TABLE]
Then we can derive (3.17) by using (3.11). ∎
3.3 DG approximations of the eigenvalue problem
We construct DG methods for eigenvalue problem (2.2): Find and , such that and
[TABLE]
Note that (2.2) and (3.22) are equivalent to and , respectively.
Denote by the spectrum and the resolvent set of the solution operator . For any in , we define the resolvent operator . Let be an eigenvalue of and be a circle in the complex plane that is centered at and does not enclose any other point of .
Define the following operators with contour integrations:
[TABLE]
If is sufficiently large, then and are the spectral projectors of and relative to , respectively (see [36]).
Define the distances
[TABLE]
Using proposition 3.3 and similar arguments as those in [1], we have the following convergence results (including non-pollution and completeness) for DG eigenvalues and eigenspaces.
Remark 3.2**.**
Let be an open set containing . If and are sufficiently large, then . Moreover, for all , we have
[TABLE]
In addition, we have
[TABLE]
where denotes the range.
Now we can derive the following a priori error estimate for DG approximations.
Theorem 3.1**.**
Assume that (3.10) is true and is sufficiently large. Let be an eigenvalue of (2.2) with algebraic multiplicity m. Then for sufficiently large, there exist eigenpairs of (3.22) such that
[TABLE]
where the constant depends only on and .
Proof.
Note that for , and (see [21], p.257, Thm. 9 and (8.137)).
For , we have from Proposition 3.3 that
[TABLE]
which implies
[TABLE]
Using (3.24) and [36, Theorem 1], we have the convergence of the eigenvalues and
[TABLE]
Then it is only necessary for us to estimate the right-hand side of (3.25).
Using proposition 3.3, the regularity result Lemma 2.1 and the fact for , we have that for any ,
[TABLE]
where is a constant depending only on and .
It is apparent from (3.25) and (3.26) that
[TABLE]
Let and be the dimensions of and , respectively. Then, (3.27) indicates that, for large enough, (see [29, p.200]) and there exist eigenfunctions and eigenpairs satisfying (3.22). Moreover, according to the definition of distance , we can find and such that
[TABLE]
This completes the proof of error estimates for eigenfunctions.
For eigenvalues, we obtain by a simple calculation that
[TABLE]
with the consistency error
[TABLE]
Using (3.26) to (3.30), we obtain
[TABLE]
where the constant depends only on and . ∎
Remark 3.3**.**
We emphasize that our result works not only for the case of single eigenvalue (), but also for general cases of multiple eigenvalue ().
Remark 3.4**.**
It is shown in many cases that the convergence rate of finite dimensional approximations under a weaker norm is faster than that under a stronger norm (see, e.g., [5, 16]). By making this assumption for our DG approximations, for example,
[TABLE]
it may be true from (3.3) and (3.30) that the eigenvalue approximations have better convergence rate than that of eigenfunctions.
Remark 3.5**.**
Within the framework of Kohn-Sham density functional theory, one has to solve the nonlinear eigenvalue problem (1.1) with a SCF iteration. Using our DG discretizations, the linear eigenvalue problem (3.22) is solved at each iteration step and complex mixing schemes such as Roothaan, level-shifting and DIIS algorithms (see, e.g., [12, 30]) are used to achieve convergence.
If the exchange-correlation potential is sufficiently smooth and the trial state (from previous DG approximations) , then we have from similar arguments as those in [22] that the eigenfunctions of belong to . This regularity together with the analysis in Theorem 3.1 gives spectral convergence rates for DG approximations of the (linear) eigenvalue problem in each SCF iteration step.
Note that we have not obtained a priori error estimates for approximations of nonlinear eigenvalue problems but only for linearized equations in SCF iterations. We refer to [13, 17] for numerical analysis of nonlinear eigenvalue problems.
4 Numerical experiments
In this section, we will present some details for implementing our DG scheme, and some numerical experiments in electronic structure calculations.
4.1 Hamiltonian matrix elements
With our DG scheme, we can discretize the continuous eigenvalue problem into a (finite dimensional) matrix generalized eigenvalue problem
[TABLE]
where are eigenvectors that correspond to the DG approximations . We shall explain in the following how the matrix elements of and are generated.
For basis functions and , We divide the integrals for overlap matrix and stiff matrix into three parts. The scattering identity (see, e.g., [35])
[TABLE]
with , is heavily used to bridge the gap between plane waves and spherical harmonics.
For , we have
[TABLE]
where is the Fourier transform of the step function with 0 inside the sphere and 1 outside
[TABLE]
with and the th spherical Bessel function. Similarly, we have from (3.12) that
[TABLE]
where
[TABLE]
with and the potential inside the sphere expanded by . The discontinuity and penalization term in (4.4) is given by
[TABLE]
with and . Note that the first term of (4.5) is obtained by fast Fourier transform (FFT) and the second term is calculated by numerical integrations.
For , we have from the orthogonality of on the surface that
[TABLE]
and
[TABLE]
where the potential inside the sphere is expanded by and is the integral of three spherical harmonics that can be written in terms of Gaunt coefficients (see, e.g., [34]). The discontinuity and penalization term is
[TABLE]
For , we have
[TABLE]
and
[TABLE]
Since we use a symmetric DG scheme, the elements for can be obtained immediately.
Combining (4.2) – (4.1), we can obtain the matrices and , and further solve the matrix eigenvalue problems by linear eigensolvers.
4.2 Numerical results
All the numerical results are presented by atomic units (a.u.). When we test the convergence with respect to one parameter (say, , or ), the other two parameters are fixed and chosen to be sufficiently large.
Example 1. (linear problem for a single-atom system) Consider the linear eigenvalue problem: Find and such that
[TABLE]
with and . Note that the potential can be viewed as a periodized version of the potential for a hydrogen atom. It is periodic and sufficiently smooth everywhere except at the origin. Then due to Lemma 2.1, the error estimates in Theorem 3.1 hold.
We first compare the numerical errors of the lowest eigenvalue approximations by plane waves and our DG methods (see Figure 4.4), from which we observe that the DG approximations converge much faster. We compare the eigenfunctions along the -axis obtained by plane waves and DG methods (see Figure 4.4). We observe that the DG approximations can capture the cusp at the nuclear position while that plane waves can not. For a more precise comparison, when the required accuracy is (for the first eigenvalue), the DG method needs around degrees of freedom (DOFs) while the plane waves method need about DOFs; when the required accuracy is , the DG method needs around 300 DOFs while the plane waves method needs more than 1100 DOFs.
We further show the convergence rates of the eigenvalue errors with respect to plane wave truncations (see Figure 4.4), and observe exponential decay for different sizes of atomic spheres. We find a slightly faster convergence rate of the numerical errors (in Figure 4.4) with a bigger size of atomic sphere. The reason is that the eigenfunctions are less varying outside a larger atomic sphere. However, we see that the choice of does not affect the numerical simulations significantly. In practical simulations, we could choose relatively large atomic spheres as long as they do not overlap.
We also present the numerical errors with respect to the orders of radial basis functions (see Figure 4.4), and compare the polynomials with Slater-type atomic orbitals
[TABLE]
with a fixed parameter. We observe that although a high accuracy can be obtained by Slater-type atomic orbitals with very few degrees of freedom, a better systematically convergence rate is achieved by polynomials.
Example 2. (linear problem for a two-atom system) Consider the linear eigenvalue problem for a two-atom system: Find and such that
[TABLE]
where and with and the positions of atoms.
We first compare the numerical errors of the the lowest eigenvalue approximations by plane waves and our DG methods. We observe a much better convergence rate with respect to in Figure 4.10 and a more accurate capture of the eigenfunction cusp by our DG approximation in Figure 4.10. For a more precise comparison, when the required accuracy is , the DG method needs around 100 DOFs while the plane waves method need about 30 DOFs; when the required accuracy is , the DG method needs around 400 DOFs while the plane waves method needs more than 1000 DOFs.
We then show the convergence rates of the eigenvalue errors with respect to plane wave truncations (see Figure 4.4), and angular momentum truncation (see Figure 4.10) We observe exponential decay with respect to both and for different sizes of atomic spheres. In this example, when the radii of atomic spheres are larger than 0.5, increasing the size of spheres does not improve the convergence rate significantly (see Figure 4.10). From the comparisons of different radii, we get the same conclusion as Example 1 that the choice of is not important in our scheme, and one can simply choose relative large radii such that the atomic spheres do not overlap.
We further show the convergence rates of numerical errors for the lowest 3 eigenvalues, and observe exponential decay of the numerical errors with respect to (see Figure 4.10). This supports our theory.
Finally, we test the effect of penalty parameter . In our DG scheme, the penalty constant plays an important role to guarantee stability. The errors with respect to different choices are shown in Figure 4.10. We observe that the DG method can be stable and accurate in a large range of values beyond a certain threshold value. Similar discussions for the penalty parameter can also be found in [31].
Example 3. (simulation of a helium atom) Consider the following nonlinear eigenvalue problem: Find and such that
[TABLE]
with the external potential , the Hartree potential and . Note that the exchange-correlation potential is ignored here from a standard Kohn-Sham DFT model. We present the eigenfunction along the -axis (see Figure 4.12) and the convergence rates of numerical errors for different sizes of atomic spheres (see Figure 4.12). We observe exponential decay of the numerical errors with respect to even for the nonlinear problem.
5 Concluding remarks
In this paper, we construct a discontinuous Galerkin scheme for full-potential electronic structure calculations. It exploits the idea of augmented plane wave method which approximates the wavefunction in some ways “the best of two worlds”. The smoothly varying parts of the wavefunctions between the atoms are represented by plane waves, the rapidly varying parts near the nuclei are represented by radial atomic functions times spherical harmonics inside a sphere around each nucleus, and these two parts are patched together by discontinuous Galerkin scheme. We demonstrate a priori error estimate of this approximation to illustrate the accuracy and efficiency of this scheme, and provide some numerical experiments to support the theory.
Besides the accuracy and efficiency we have shown in this paper, the discontinuous Galerkin scheme is also flexible and economical for adaptive procedures since the nonconformity results assuredly in limiting the contamination only to the subdomain where refinement is needed. The a posteriori error analysis and the adaptive algorithm will be addressed in our future works.
Acknowledgement
We are grateful to Reinhold Schneider in Technische Universität Berlin for his help in this work and for inspiring discussions.
Appendix Appendix A Inverse estimates on the surface
In this appendix, we shall provide the numerical tests to support the inverse estimate assumption (3.10) and the “interpolation” arguments to obtain (3.11).
Let
[TABLE]
Consider the largest eigenvalue of the following discrete eigenvalue problem on the spherical surface : Find and such that
[TABLE]
We perform numerical simulations for (A.1) and present the scalings of (with respect to the discretizations ) in Figure A.1 for different sizes of atomic spheres.
We observe from the numerics that for all different radii , which together with the fact
[TABLE]
implies
[TABLE]
which supports the inverse estimate assumption (3.10).
We then use the “interpolation” between two spaces and . For any and , define
[TABLE]
and the -norm through “interpolation” [10]: . For any , we have
[TABLE]
To see (A.4), we have by taking in (A.3) and by choosing . Using these two inequalities, we can derive
[TABLE]
Combining (A.2) and (A.4), we can obtain the inverse estimate (3.11) .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P.F. Antonietti, A. Buffa, and I. Perugia. Discontinuous Galerkin approximation of the Laplace eigenproblem. Comp. Method. Appl. M. , 195(25):3483–3503, 2006.
- 2[2] D.N. Arnold. An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal. , 19(4):742–760, 1982.
- 3[3] D.N. Arnold, F. Brezzi, B. Cockburn, and D. Marini. Discontinuous Galerkin methods for elliptic problems. In B. Cockburn, G. Karniadakis, and C.W. Shu, editors, Discontinuous Galerkin Methods. Theory, Computation and Applications , volume 11, pages 89–101. Springer-Verlag, 2000.
- 4[4] K. Atkinson and W. Han. Theoretical Numerical Analysis : A Functional Analysis Framework 3rd ed. Springer-Verlag, 2009.
- 5[5] I. Babuška and J. Osborn. Eigenvalue problems. In P.G. Ciarlet and J.L. Lions, editors, Finite Element Methods (Part 1) , volume 2 of Handbook of Numerical Analysis , pages 641–787. North-Holland: Elsevier Science Publishers, 1991.
- 6[6] I. Babuška and M. Zlámal. Nonconforming elements in the finite element method with penalty. SIAM J. Numer. Anal. , 10(5):863–875, 1973.
- 7[7] M. Bachmayr, H. Chen, and R. Schneider. Error estimates for Hermite and even-tempered Gaussian approximations in quantum chemistry. Numer. Math. , 128(1):137–165, 2014.
- 8[8] X. Blanc, E. Cancès, and M.S. Dupuy. Variational projector augmented-wave method: theoretical analysis and preliminary numerical results. C. R. Math. Acad. Sci. Paris , 355(6):665–670, 2017.
