 Research article
 Open Access
 Published:
Convergence study of the hadaptive PUM and the hpadaptive FEM applied to eigenvalue problems in quantum mechanics
Advanced Modeling and Simulation in Engineering Sciences volume 4, Article number: 7 (2017)
Abstract
In this paper the hadaptive partitionofunity method and the h and hpadaptive finite element method are applied to eigenvalue problems arising in quantum mechanics, namely, the Schrödinger equation with Coulomb and harmonic potentials, and the allelectron Kohn–Sham density functional theory. The partitionofunity method is equipped with an a posteriori error estimator, thus enabling implementation of errorcontrolled adaptive mesh refinement strategies. To that end, local interpolation error estimates are derived for the partitionofunity method enriched with a class of exponential functions. The efficiency of the hadaptive partitionofunity method is compared to the h and hpadaptive finite element method. The latter is implemented by adopting the analyticity estimate from Legendre coefficients. An extension of this approach to multiple solution vectors is proposed. Numerical results confirm the theoretically predicted convergence rates and remarkable accuracy of the hadaptive partitionofunity approach. Implementational details of the partitionofunity method related to enforcing continuity with hanging nodes are discussed.
Introduction
Recently there has been an increase of interest in applying finite element (FE) methods to partial differential equations (PDEs) in quantum mechanics [1,2,3,4,5,6,7,8,9,10,11,12,13,14]. In order to improve the accuracy of the solution, the basis set can be adaptively expanded through either refinement of the mesh (hadaptivity) or the basis functions can be augmented by the introduction of higher polynomial degree basis functions (padaptivity). Since the solution is not smooth and contains cusp singularities, the application of the hadaptive FEM may require very fine meshes and could be computationally inefficient. There are several approaches to circumvent this problem.
From the physical point of view, for ab initio calculation of molecules often core electrons (as opposed to valence electrons) behave in a similar way to single atom solutions. Thus one possesses an a priori knowledge of a part of the solution vectors to the eigenvalue problem. One of the approaches used to introduce this into a FE formulation is the partitionofunity method (PUM) [15,16,17], which is a generalization of the classical FE method. In PUM the enrichment functions are introduced into a basis as products with standard FE shape functions, thereby enlarging the standard FE space. As the standard FE functions satisfy the partitionofunity property (that is, they sum to one in the whole domain), the resulting basis can reproduce enrichment functions exactly. For an overview on PUM applied to continuum mechanics we refer the reader to [18,19,20].
An alternative approach to the above is to combine h and padaptivity resulting in what is termed as hpadaptive FEM. For an overview of hpadaptive refinement strategies we refer the reader to [21]. The general idea is that when the exact solution is smooth on the given element, padaptive refinement is more efficient and leads to a faster convergence with respect to the number of degrees of freedom; whereas if the solution is nonsmooth (singular), hadaptive refinement is performed. Thus in addition to a reliable error estimate and the choice of the marking strategy of elements for refinement, hpadaptive methods need to decide which type of refinement to perform on a given element. In this work we use methods based on smoothness estimation [22,23,24,25,26,27]. As those methods are normally employed for problems with a single solution vector, we propose an extension to multiple solution vectors as is required for the here considered eigenvalue problems.
Herein, our main focus is application of hadaptive PUM to PDEs in quantum mechanics, namely to the Schrödinger equation and the allelectron density functional theory (DFT) [28, 29]. Application of the PUM to the above problems holds a significant promise to improve on accuracy of a standard (nonenriched) FE approximation. The corresponding numerical evidence can be found in [9], where convergence studies for PUM solutions obtained on uniformly refined meshes are performed.
The novelty of our paper is that the PUM will be equipped with an a posteriori error estimator, thus enabling implementation of errorcontrolled adaptive mesh refinement strategies. Derivation and implementation of the PUM in computational solid mechanics is nowadays very wellacknowledged and established area of research, yet the authors are not aware of any other work which applies the hadaptive PUM to DFT.
We will also compare the PUM to hpadaptive FEM in terms of the efficiency with respect to the number of degrees of freedom. Although there are publications on the topic of hpadaptive FEM applied to DFT [1], they lack any numerical studies and are limited to a predefined refinement strategy of hexahedra that admit nuclei only at its vertices. In order to apply the hpadaptive FEM to DFT, in this paper we propose an extension of the smoothness estimate approach using Legendre coefficients [22,23,24,25] to multiple solutions vectors.
The outline of this paper is as follows: In the section on “Theory”, we introduce the eigenvalue problem studied here. The PUM and error estimators are also discussed. We also explain the strategy employed to decide between h and padaptive refinement for the hpadaptive FEM. Results of numerical studies of the chosen systems are presented in section titled “Results and discussion”, followed by some conclusions. In Appendix A we rigorously derive the local interpolation error estimates for enrichment with a class of exponential functions; Appendix B describes the approach applied to solve single atom DFT in radial coordinates within application of the PUM; Appendix C discusses implementational details of PUM within the context of the deal.II [30] library.
Theory
In quantum mechanics we seek the N lowest eigenpairs \((\lambda _\alpha ,\psi _\alpha )\) of the Schrödinger equation [31]
Here \(\alpha \) is the index of the eigenpair, \(\Omega \) is a Lipschitz domain^{Footnote 1} in \(\mathbb {R}^3\) and \(\delta _{\alpha \beta }\) is the Kronecker delta . In Kohn–Sham allelectron density functional theory [28, 29], the potential \(V(\mathbf{x })\) depends on eigenvectors thus rendering the problem nonlinear. For a molecular system consisting of \(N_e\) electrons and M nuclei of charges \(\{Z_\mathrm{I}\}\) located at the (fixed) positions \(\{{\mathbf {\mathsf{{R}}}}_\mathrm{I}\}\), the ground state electron density \(\rho (\mathbf{x }):= \sum _{\alpha =1}^{N} f_\alpha \left\psi _{\alpha }(\mathbf{x }) \right^2 \) can be obtained by finding the N lowest eigenpairs of Eq. (1). Here \(f_\alpha \) is the partial occupancy number^{Footnote 2} of the \(\alpha \)orbital such that \(\sum _{\alpha =1}^{N} f_\alpha = N_e\), \(V=V_{\mathrm{ion}}+V_{Hartree}+V_{\mathrm{xc}}\) is composed of the ionic potential \(V_{ion}=\sum _{\mathrm{I=1}}^M \frac{Z_{\mathrm{I}}}{\left \mathbf{x }  {\mathbf {\mathsf{{R}}}}_{\mathrm{I}} \right }\), the Hartree potential \(V_{Hartree}=\int _\Omega \rho (\mathbf{x }')/\mathbf{x } \mathbf{x }'\mathrm{d} \mathbf{x }'\), and the (given) exchangecorrelation potential \(V_{xc}(\rho )\). As a result, the potential V depends on the density \(\rho \) which is given in terms of eigenvectors \(\{\psi _\alpha \}\), making the problem nonlinear. From practical perspective \(V_{Hartree}\) electrostatic potential is obtained by solving the associated Laplace equation; together with (1) they are solved sequentially untill convergence in density fields \(\rho \) is attained. For further details on the FE solution of DFT, we refer to our previous work [2] and literature cited therein.
The weak form of Eq. (1) reads^{Footnote 3}
We then introduce a FE triangulation \(\mathcal {P}^h\) of \(\Omega \) and the associated FE space of continuous piecewise elements of a fixed polynomial degree : \(\psi _\alpha \in V^h \subset H^1_0 (\Omega )\). The FE solution to the problem is then defined by
Partitionofunity method
The classical FEM with piecewise linear ansatz spaces requires very fine meshes for adequate accuracy when the solution is not smooth or is highly oscillatory; this increases the computational cost of solving the problem. The PUM proposed by Melenk and Babuska in [15, 16] can address this issue. The main feature of the PUM is the inclusion of an a priori knowledge about the solution properties into the FE space. The PUM enriches the vector space spanned by standard FE basis functions \(N_i(\mathbf{x })\) (e.g. polynomials) by products of these functions with functions \(f_{j}(\mathbf{x })\) that contain apriori knowledge about the solution
Here \(\psi ^i_\alpha \) are standard degreesoffreedom (DoFs) and \(\widetilde{\psi }^{ij}_\alpha \) are additional DoFs associated with the shape functions \(N_i(\mathbf{x })\) and the enrichment functions \(f_j(\mathbf{x })\); I is a set of all nodes and S is the set of enrichment functions. Since (possibly global) enrichment functions \(f_j(\mathbf{x })\) are multiplied with \(N_i(\mathbf{x })\) which has local support, the product also has local support and therefore matrices arising from the weak form remain sparse. Also, since the standard shape functions satisfy the partition of unity property \(\sum _i N_i(\mathbf{x }) \equiv 1\), the resulting vector space can reproduce enrichment functions \(f_j(\mathbf{x })\) exactly.
Note that (4) is a more general approach than enriching the basis with \(f_j\) alone (i.e. without multiplying by \(N_i\), as is employed in [32]). Granted the partition of unity property of \(N_i\), this case can be obtained from (4) by requiring all DoFs associated with a given enrichment function \(f_j\) to have the same value.
Error estimator
A posteriori error estimation analysis for FE approximations of (secondorder) eigenvalue problems has been a topic of intensive study within the last several decades, both from theoretical and implementational standpoints. We refer the interested reader to [13, 14, 33,34,35,36,37,38,39], where two “conventional” types of error estimators, namely residual and averagingbased error estimators, are presented.
In general, a discretization error in approximated eigenfunctions, \(\psi \psi ^h\), measured in a suitable norm (e.g. \(L^2\)norm and energy norm, induced by the bilinear form of a problem), as well as in approximated eigenvalues, \(\lambda \lambda ^h\), can be estimated from above. That is,
and
where \(C_1,C_2\) are the socalled stability constants that are independent of the mesh size and \(\eta \) is the explicitly computable ^{Footnote 4} error upperbound, see e.g. [34, 38] for details. These equations are typically termed (global) error estimators. The bound \(\eta \) reads as
where summation is performed over all elements in \(\mathcal {P}^h\) and \(\eta _K\) is the (local) error indicator, a quantity showing a discretization error of \(\{\psi ^h,\lambda ^h\}\) elementwise, that is, on every fixed K. With multiple solutions available (in this case, eigenpairs \(\{\psi ^h_\alpha ,\lambda ^h_\alpha \}\)), \(\eta _K\) will be a sum of discretization errors of the corresponding eigenpairs on a given element K, that is
For a standard (nonenriched) \(\mathbb {Q}_1\)based finite element solution of (1), a local indicator \(\eta _{K,\alpha }\) of residual type reads as follows (see [13, 14, 34, 35, 38, 39] for details):
where \([[\frac{1}{2}{\nabla } \psi ^h_\alpha \cdot \mathbf{n } ]]_e:=\left[ \frac{1}{2} {\nabla } \psi ^h_\alpha \,_{K}+\frac{1}{2}\nabla \psi ^h_\alpha \,_{K'} \right] \cdot \mathbf{n }_e\) represents the jump of the gradient across interface e between two adjacent elements K and \(K'\), \(\mathbf{n }_e\) is the outward unit normal vector to e and \(h_K:=\mathrm {diam}(K)\).
One of the key findings of our work is the proof that indicator (7) also holds (with no modification due to the enrichment usage) in the PUM with the exponential enrichment function \(f(\mathbf{x }) = \exp {(\mu \left\mathbf{x } \right^k)}\). In Appendix A, we derive and prove the related local interpolation error estimates required for the derivation of the error indicator (7).
hpadaptive solution
There have been numerous works devoted to hpadaptive refinement [22,23,24,25, 40,41,42] including a comparison of different methods [21]. The main difficulty that a posteriori hpadaptive methods aim to address is the following: once an error is estimated and a certain subset of elements is marked for refinement, one has to choose between h or prefinement for each element. In this work we adopt an hprefinement method based on the estimate of the analyticity of the solution^{Footnote 5} on the reference element via expansion into Legendre bases [22,23,24,25]. In particular, the FE solution is analytic on element K if, and only if, there exists constants \(C_K\) and \(\sigma _K\) such that
where \(a_{ijk}\) are Legendre coefficients; see [25] for further details. We chose to estimate the decay coefficient \(\sigma _K\) by performing a least squares fit of Legendre coefficients in each direction \(\ln \lefta_{d,i}^K \right \sim \ln C_K^d  \sigma _K^d \, i \) for \(1 \le i \le p_K\), and then use the minimum decay coefficient as the final value \(\sigma _K=\min _d \sigma _K^d\). When \(\sigma _K\) value is below a chosen parameter \(\sigma _0\), the solution is considered to be smooth at K and thus prefinement is performed, otherwise hrefinement is executed. For initially linear FEs prefinement is always performed. We note that methods based on the decay rate of the expansion coefficients were found in [21] to be the best choice as a general strategy for the hpadaptive solution of elliptic problems. To the best of our knowledge there is, however, very little (numerical) study of those methods applied to DFT. The only paper we are aware of [1] lacks any numerical results. We also note that, in the majority of cases, hpadaptive FEM is applied to problems in \(\mathbb {R}^1\) and \(\mathbb {R}^2\). Thus we also aim to evaluate how well the smoothness estimators proposed in the literature work for eigenvalue problems in \(\mathbb {R}^3\) that are relevant to quantum mechanics. In order to extend this hprefinement strategy to the eigenvalue problem, that is when there are multiple vectors represented using the same FE basis, we propose the following approach. For each element we find an eigenvector which contributes the most to the total element’s error. The smoothness of this vector is the basis on which we decide to perform hrefinement or prefinement. The rationale behind this approach is that we aim at minimizing the error the most during a single refinement step while being conservative and avoiding performing both h and prefinement on the same element. We also investigated allowing both h and padaptive refinement of a single cell based on smoothness estimation of all eigenvectors, but ultimately found that this procedure leads to qualitatively similar results for the problems studied herein.
Finally, for the error indicator we adopt the following expression [43]
where \(h_e\) is the face’s diameter, \(p_K\) is the element’s polynomial degree and \(p_e\) is the maximum polynomial degree over two elements K and \(K'\) adjacent to the face e.
The derivation of the error estimators for hpFEM usually requires the polynomial degree of neighbouring elements to be comparable, namely that there exists \(\gamma \) and \(\Gamma \) such that \(\gamma p_K \le p_{K^\prime } \le \Gamma p_K\) for all elements \(K, K^\prime \) that have a nonempty intersection. In order to reflect this assumption in our numerical scheme, we propose that an additional step which limits the differences in polynomial degrees among elements be performed. More precisely, after hpadaptive refinement is executed, then for each element K, we find the maximum polynomial degree among its neighbouring elements \(p_\mathrm{neigh}^\mathrm{max}\) and if \(p_\mathrm{neigh}^\mathrm{max} > p_K + 2\) then we set \(p_K \leftarrow p_K+1\).
Results and discussion
If not explicitly stated otherwise, the results below are obtained for the following configuration: (i) the initial polynomial degree for nonenriched DoFs is one for hpadaptive FEM; (ii) linear shape functions are used in PUM to introduce enrichments, higher order elements were not employed as the interpolation error estimates are derived only for linear elements and thus limit the applicability of the error indicator stated in Eq. (7) ; (iii) a Gaussian quadrature rule with \(20^3\) points is used for enriched elements in the eigenvalue problem; (iv) the Dörfler marking strategy with \(\theta = 0.6\) is used to mark elements for refinement; (v) Gauss–Legendre–Lobatto supports points are used for the hpadaptive FEM basis to improve the condition number; (vi) in case of hpadaptive refinement the highest polynomial degree is limited to 8 for computational efficiency reasons; (vii) the radius in which enriched FEs are employed is heuristically chosen for each numerical example; (viii) following [25] we choose \(\sigma _0=1.0\) as a parameter in the smoothness estimator.^{Footnote 6} Implementation details of the partitionofunity method in deal.II [30] finite element library are given in Appendix C.
Schrödinger equation
In this section we consider the Schrödinger equation Eq. (1) with two different (spherical) potentials \(V(\mathbf{x })=V(\left\mathbf{x } \right)\).^{Footnote 7} The first case is the Coulomb potential \(V(\mathbf{x }) = \,1/\left\mathbf{x } \right\), which corresponds to a Hydrogen atom. The eigenvalues of this problem are degenerate. In \(\mathbb {R}^3\), on each energy level n there are \(n^2\) eigenvalues \(\lambda _n = \lambda _1/n^2\), where \(\lambda _1 = \,1/2\) [31]. The eigenfunction corresponding to the lowest eigenvalue reads
The radial component of the eigenfunctions at the next energy level are \(R_{2,0}=[1\left\mathbf{x } \right/2]\exp (\left\mathbf{x } \right/2)\) and \(R_{2,1}=\left\mathbf{x } \right/2\exp (\left\mathbf{x } \right/2)\).
The second potential we will consider is a harmonic potential \(V(\mathbf{x })=\left\mathbf{x } \right^2/2\) that leads to a harmonic oscillator problem. The eigenvalues for this problem are also degenerate; in \(\mathbb {R}^3\) they are given by \(\lambda _n = n+1/2\) for nth energy level. The lowest two have a degeneracy of 1 and 3, respectively. The (unnormalized) eigenfunction corresponding to the lowest eigenvalue is
The radial component of the next eigenfunction is \(R_{0,1}(\mathbf{x }) = \left\mathbf{x } \right \exp \left( \left\mathbf{x } \right^2/2 \right) \). Figure 1 shows radial components of eigenfunctions for the Coulomb and the harmonic potential. It is clear that in order to have a low interpolation error for a standard Lagrange FE basis, a very fine mesh will be required near the origin. For such nonsmooth solutions we will see that by introducing enrichment functions the interpolation error of the resulting FE basis will be greatly reduced.
The initial mesh used to solve the Schrödinger equation is obtained from 3 global mesh refinements of the single element in \(\Omega =[\,20;20]^3\) for the Coulomb potential and \(\Omega =[\,10;10]^3\) for the harmonic potential. For the PUM only 8 elements adjacent to the singularity that is located at the origin are marked for enrichment.
First, we examine the convergence in case when a single eigenpair is required in the Schrödinger equation with two different potentials. Figure 2 compares the hadaptive FEM, hpadaptive FEM and hadaptive PUM, whereas Fig. 3 shows the crosssections of meshes for the last refinement step.
For both combinations of potentials and enrichment functions, the hadaptive PUM is superior to hadaptive FEM. In particular, for the last refinement step the PUM solution is about two orders more accurate than the hadaptive FEM with the same number of DoFs in the case of the Coulomb potential. For the harmonic potential this value is smaller. The asymptotic convergence rate of the hadaptive PUM with the default enrichment radius is very similar to that of the hadaptive FEM for both problems (compare green and red lines in Fig. 2), which supports our theoretical findings.
The advantage of the hadaptive PUM also depends on the enrichment radius with respect to the underlying exact solution. To examine this effect we employ an initial mesh obtained only by two global refinements of a single element and mark the 8 elements adjacent to the origin for enrichment. With this approach we effectively consider a larger enrichment domain \([\,5;5]^3\) instead of \([\,2.5;2.5]^3\). Importantly, the numerically nonzero part of the underlying analytical solution will be almost fully contained in those 8 elements (see Fig. 1b). From the numerical results we observe that for the most refined stage the hadaptive PUM displays an error which is about 6 orders of magnitude less than the same method with the smaller enrichment domain (compare purple and green lines in Fig. 2b).
For the case of a single eigenpair, the hpadaptive FEM performs remarkably well and, unless a larger enrichment radius is used in hPUM, it converges to the higher tolerance with fewer number of DoFs (compare blue and green lines in Fig. 2).
Now let us turn our attention to a more realistic scenario where one seeks multiple eigenpairs whereby an a priori knowledge is available only for the first eigenfunction. Figure 4 plots the convergence of the first 5 eigenvalues for the Coulomb potential and the first 4 eigenvalues for the harmonic potential for the different methods. For both problems the h adaptive PUM again has remarkable convergence properties, superior to hadaptive FEM. It is important to note that even though in the PUM the enrichment function corresponds to the first eigenfunction only, other eigenpairs in the case of the harmonic potential tend to converge faster than the standard hadaptive FEM case, as can be observed in Fig. 4b. The same applies to the spherical orbital at the second energy level of the Hydrogen atom; see Fig. 4a where the corresponding eigenvalue in the PUM case displays a faster convergence rate than the others on the same energy level.
For the Hydrogen atom, in the case of the hpadaptive refinement one observes a superior convergence rate of the first eigenvalue, whereas eigenvalues from the next energy level have errors that are comparable to the hadaptive linear FEM. A possible issue could be related to the smoothness estimation on elements with hanging nodes. In particular it is observed [44] that the smoothness is overestimated when using similar methods, albeit based on Fourier coefficients. This leads to unnecessarily high order polynomial degrees in these areas. Clearly, further investigation is required to resolve this problem.
Density functional theory
Finally, we apply the here considered FE approaches to the Kohn–Sham density functional theory. As a first test problem we consider a single He atom which has a single doubly occupied state, i.e. \(N_e=2\) and \(N=1\). The ground state energy from the radial solution is \(E_0=\,2.834289\). Enrichment functions for PUM are obtained from numerical solution of single atom Schrödinger equations, depicted in Fig. 5a. The atom is placed at the origin in the domain \(\Omega =[\,10;10]^3\) with the homogeneous mesh of size \(h=2.5\). Eight elements adjacent to the atom are enriched.
Figure 5b compares the hadaptive FEM, hpadaptive FEM and hadaptive PUM. One immediately recognizes that the PUM leads to a much faster convergence in terms of DoFs and gives about an order of magnitude advantage in terms of the absolute value of the error. The linear hadaptive FEM would require ten times more DoFs to achieve the same accuracy. The hpadaptive FEM displays an exponentiallike decay and approaches the accuracy of PUM at higher number of DoFs.
In the second test problem we consider a CO molecule in the domain \(\Omega =[\,10;10]^3\) at the (equilibrium) distance 2.1. In order to estimate the ground state energy, we fit the total energy obtained by hFEM at the last 3 mesh refinement steps to \(\mathrm{ln}(E^hE_0) = C + q\,\mathrm{ln}( \mathrm{DoFs})\) with constraints \(C>0,\,E_0<E^h,\,q<0\). Using this approach we estimate the limit of the ground state energy to be \(E_0=\,112.47107\). This renders a bond energy^{Footnote 8} of \(\,0.5775\), which compares favourably to the value \(\,0.578\) reported in [45]. This gives us confidence to use the estimated ground state energy value in convergence studies, which are presented in Fig. 6.
The enrichment functions for PUM are obtained from the numerical solution of single atom Schrödinger equations; see Appendix B for details. The scaling of those functions are not important for PUM, so Fig. 6a depicts radial solutions normalized so that the value of the 1s and 2s orbitals are unity at the origin. It is generally possible to use all eigenfunctions from the radial solution as enrichments around each atom in the radius of a few atomic units. However, extra care must be taken not to render the resulting FE space to have linearly dependent basis functions. Figure 6a clearly indicates that given small enough elements (on the order 0.1 a.u.), enriching with both 1s and 2s single atom radial core electrons solutions would make the FE space degenerate. Our current implementation of PUM DFT only supports enrichment in nonoverlapping domains. Therefore for the CO molecule we have to start from a relatively fine mesh, which in the course of hadaptive refinement may render the basis enriched with multiple functions linearly dependent. To avoid this, the PUM results for the CO molecule are obtained by enriching 8 elements adjacent to each atom with its 1s orbital only. Scaling of the 1s function to unity at the origin of the enrichment spherical function improves the condition number of the resulting matrices.
Figure 6b compares the convergence characteristics using the hadaptive FEM, hpadaptive FEM and hadaptive PUM. The energy error convergence rate from hadaptive FEM compares favourably to the expected rate of \(\mathcal {{O}}(h^{2p})\), which can be approximated by \(\mathcal {{O}}(\mathrm{DoFs}^{2p/3})\). Remarkably, the chosen smoothness estimate used in the hpadaptive FEM and its extension to multiple vectors do not lead to an increase in efficiency in terms of the number of DoFs as compared to hadaptive quadratic FEM. The hadaptive PUM displays the same convergence rate as hadaptive FEM and is, as expected, more accurate. This, however, comes at the expense of having a worse condition number for the resulting matrices and the necessity to use higher quadrature order to perform sufficiently accurate numerical integration. For this example and the chosen enrichment radius, the difference in energy error between the two approaches is less than one order of magnitude. By comparing these results to those presented earlier for H and He atoms, we hypothetize that a larger enrichment radius is required to make the PUM advantageous compared to the hadaptive FEM. Our current implementation of PUM DFT, however, only allows enrichment in nonoverlapping domains, which limited the enrichment radius for the CO example.
Conclusions
In this contribution we have applied and critically compared the h and hpadaptive FEM, and the hadaptive PUM to the relevant PDEs in quantum mechanics, namely the Schrödinger equation and the Kohn–Sham allelectron density functional theory. The main findings are summarized below.

The PUM renders several orders of magnitude more accurate eigenvalues than the standard FEM when solving the Schrödinger equation for the lowest eigenpair with Coulomb and harmonic potential. For the case when more eigenpairs are sought but only the lowest eigenvector is introduced as an enrichment, the PUM is still more accurate, especially for the lowest eigenvalue. Remarkably other eigenvalues also exhibit a faster convergence. The results from DFT calculations indicate that in order to keep this advantage, a reasonably large enrichment radius is needed.

For problems where a single eigenpair is being sought, the hpadaptive FEM with the here considered smoothness and residual error estimators results in a more accurate solution with fewer number of DoFs as compared to hadaptive PUM and FEM. However, for the case of multiple eigenpairs this approach did not lead to satisfactory results. Overall we find hadaptive PUM to be a more robust solution method to reach the required accuracy even with relatively small enrichment domains.

Local interpolation error estimates are derived for the PUM enriched with the class of exponential functions. In this case the results are the same as for the standard FEM and thereby admit the usage of the error indicator (7).

For the PUM DFT calculations the convergence rate of energy error and the residual error estimator are the same for all studied examples. Thus our numerical results confirm that Eq. (7) can be considered as a reliable error indicator for problems in quantum mechanics.

An element view to the implementation of PUM in FEM codes based on hexahedra is proposed (see Appendix C). As a result, continuity of the enriched field along the edges with hanging nodes is enforced by treating FE spaces produced by each function in the local approximation space separately. The resulting algebraic constraints are independent on the enrichment functions. This allows one to directly reuse algorithms written for enforcing continuity of vectorvalued FE spaces constructed from a list of scalarvalued FEs.
Notes
 1.
Note that in the nonperiodic case the Schrödinger equation is actually set in \(\mathbb {R}^3\). Therefore the domain \(\Omega \) in Eq. (1) is assumed to be sufficiently large such that zero Dirichlet boundary conditions make sense and there is no additional error due to considering a bounded domain. For all example systems that are considered below, the eigenfunctions are known to have asymptotic exponential decay which allows one to choose moderately sized domains.
 2.
For spin unpolarized systems with an even number of electrons \(f_\alpha \equiv 2\) and \(N=N_e/2\).
 3.
We use standard notation for Sobolev spaces and norms.
 4.
That is, \(\eta \) depends solely on the FE solution.
 5.
That is the measure of how well it is representable by power series.
 6.
Note that in [22] the Legendre coefficients were required to have even slower decay rate of \(\sigma _0 = 0.69\).
 7.
For spherically symmetric potentials one can separate eigenfunctions into radial \(R_{n,l}(r)\) and angular \(Y_{m,l}(\theta ,\phi )\) parts, where the latter are spherical harmonics [31]. Here \(\{n,l,m\}\) are three quantum numbers.
 8.
Singleatom energies of C and O atoms are \( \,37.42426\) and \(\,74.46933\), respectively.
 9.
This is a generalization of (4) which allows to use different FE spaces for each enrichment function. In practice one uses linear shape functions for enriched DoFs and possibly higher order shape functions for nonenriched DoFs.
 10.
For linear FEs, the value at the hanging node is the average of the values at adjacent vertices, for example \(u_5=1/2[u_8+u_2]\).
Abbreviations
 \(\mathbf{x }\) :

position vector
 \(\lambda _{\alpha }\) :

eigenvalue
 \(\psi _{\alpha }(\mathbf{x })\) :

eigenvector
 \(V(\mathbf{x })\) :

potential
 \(\Omega \) :

Lipschitz domain
 \(\mathcal {P}^h\) :

triangulation of \(\Omega \)
 \(V^h\) :

the finite element space of fixed polynomial degree
 \(\lambda _{\alpha }^h\) :

eigenvalue obtained from the finite element solution of the problem
 \(\psi _{\alpha }^h(\mathbf{x })\) :

eigenvector obtained from the finite element solution of the problem
 \(\psi ^i_\alpha \) :

standard degreesoffreedom
 \(N_i(\mathbf{x })\) :

finite element shape functions
 \(f_j(\mathbf{x })\) :

enrichment functions
 \(\widetilde{\psi }^{ij}_\alpha \) :

enriched degreesoffreedom
 \(\eta \) :

explicitly computable error upperbound
 \(\eta _K\) :

local error indicator on the element K
 \(\eta _{K,\alpha }\) :

local error indicator for eigenpair \(\alpha \) on the element K
 \(a_{ijk}\) :

Legendre coefficients
 \(\sigma _K\) :

the decay coefficient
 \(h_e\) :

the face diameter
 \(p_K\) :

the element’s polynomial degree
 \(p_e\) :

the maximum polynomial degree over two elements K and \(K'\) adjacent to the face e
References
 1.
Maday Y. h–p finite element approximation for fullpotential electronic structure calculations. Chin Ann Math Ser B. 2014;35(1):1–24.
 2.
Davydov D, Young T, Steinmann P. On the adaptive finite element analysis of the Kohn–Sham equations: methods, algorithms, and implementation. Int J Numer Methods Eng. 2016;106(11):863–88. https://doi.org/10.1002/nme.5140.
 3.
Motamarri P, Nowak MR, Leiter K, Knap J, Gavini V. Higherorder adaptive finiteelement methods for Kohn–Sham density functional theory. J Comput Phys. 2012;253(15):308–43.
 4.
Fang J, Gao X, Zhou A. A Kohn–Sham equation solver based on hexahedral finite elements. J Comput Phys. 2012;231(8):3166–80.
 5.
Pask JE, Sterne PA. Finite element methods in ab initio electronic structure calculations. Model Simul Mater Sci Eng. 2005;13(3):71–96. https://doi.org/10.1088/09650393/13/3/R01.
 6.
Zhang D, Shen L, Zhou A, Gong XG. Finite element method for solving Kohn–Sham equations based on selfadaptive tetrahedral mesh. Phys Lett A. 2008;372(30):5071–6. https://doi.org/10.1016/j.physleta.2008.05.075.
 7.
Bylaska EJ, Holst M, Weare JH. Adaptive finite element method for solving the exact Kohn–Sham equation of density functional theory. J Chem Theory Comput. 2009;5(4):937–48. https://doi.org/10.1021/ct800350j.
 8.
Bao G, Hu G, Liu D. Numerical solution of the Kohn–Sham equation by finite element methods with an adaptive mesh redistribution technique. J Sci Comput. 2012;55(2):372–91. https://doi.org/10.1007/s1091501296361.
 9.
Sukumar N, Pask JE. Classical and enriched finite element formulations for Blochperiodic boundary conditions. Int J Numer Methods Eng. 2009;77(8):1121–38.
 10.
Fattebert JL, Hornung RD, Wissink AM. Finite element approach for density functional theory calculations on locallyrefined meshes. J Comput Phys. 2007;223(2):759–73. https://doi.org/10.1016/j.jcp.2006.10.013.
 11.
White SR, Wilkins JW, Teter MP. Finiteelement method for electronic structure. Phys Rev B. 1989;39:5819–33. https://doi.org/10.1103/PhysRevB.39.5819.
 12.
Cimrman R, Novák M, Kolman R, Tŭma M, Vackář J. Isogeometric analysis in electronic structure calculations. Math Comput Simul. 2016;145:125–35. https://doi.org/10.1016/j.matcom.2016.05.011.
 13.
Chen H, Dai X, Gong X, He L, Zhou A. Adaptive finite element approximations for Kohn–Sham models. Multiscale Model Simul. 2014;12(4):1828–69. https://doi.org/10.1137/130916096.
 14.
Chen H, He L, Zhou A. Finite element approximations of nonlinear eigenvalue problems in quantum physics. Comput Methods Appl Mech Eng. 2011;200(21):1846–65.
 15.
Melenk JM, Babuška I. The partition of unity finite element method: basic theory and applications. Comput Methods Appl Mech Eng. 1996;139(1–4):289–314. https://doi.org/10.1016/S00457825(96)010870.
 16.
Babuška I, Melenk JM. The partition of unity method. Int J Numer Methods Eng. 1997;40(4):727–58.
 17.
Belytschko T, Black T. Elastic crack growth in finite elements with minimal remeshing. Int J Numer Methods Eng. 1999;45(5):601–20.
 18.
Simone A. Partition of unitybased discontinuous finite elements: gfem, pufem, xfem. Revue Européenne de Génie Civil. 2007;11(7–8):1045–68.
 19.
Belytschko T, Gracie R, Ventura G. A review of extended/generalized finite element methods for material modeling. Model Simul Mater Sci Eng. 2009;17(4):043001.
 20.
Fries TP, Belytschko T. The extended/generalized finite element method: an overview of the method and its applications. Int J Numer Methods Eng. 2010;84(3):253–304.
 21.
Mitchell WF, McClain MA. A comparison of hpadaptive strategies for elliptic partial differential equations. ACM Trans Math Softw. 2014;41(1):2.
 22.
Houston P, Süli E. A note on the design of hpadaptive finite element methods for elliptic partial differential equations. Comput Methods Appl Mech Eng. 2005;194(2):229–43.
 23.
Hartmann R, Houston P. Error estimation and adaptive mesh refinement for aerodynamic flows. In: ADIGMA—a European initiative on the development of adaptive higherorder variational methods for aerospace applications. Berlin: Springer; 2010. p. 339–53.
 24.
Mavriplis C. Adaptive mesh strategies for the spectral element method. Comput Methods Appl Mech Eng. 1994;116(1):77–86.
 25.
Eibner T, Melenk JM. An adaptive strategy for hpfem based on testing for analyticity. Comput Mech. 2007;39(5):575–95.
 26.
Fankhauser T, Wihler TP, Wirz M. The hpadaptive fem based on continuous Sobolev embeddings: isotropic refinements. Comput Math Appl. 2014;67(4):854–68.
 27.
Bangerth W, Kayserherold O. Data structures and requirements for hp finite element software. ACM Trans Math Softw. 2009;36(1):4.
 28.
Hohenberg P, Kohn W. Inhomogeneous electron gas. Phys Rev. 1964;136(3B):864–71.
 29.
Kohn W, Sham LJ. Selfconsistent equations including exchange and correlation effects. Phys Rev. 1965;140(4A):1133–8.
 30.
Arndt D, Bangerth W, Davydov D, Heister T, Heltai L, Kronbichler M, Maier M, Pelteret JP, Turcksin B, Wells D. The deal.II library, version 8.5. J Numer Math. 2017. https://doi.org/10.1515/jnma20170058.
 31.
Griffiths DJ. Introduction to quantum mechanics. 2nd ed. London: Pearson; 2005.
 32.
Kanungo B, Gavini V. Largescale allelectron density functional theory calculations using an enriched finiteelement basis. Phys Rev B. 2017;95(3):035112.
 33.
Verfürth R. A review of a posteriori error estimation and adaptive meshrefinement techniques. New York: Wiley; 1996.
 34.
Larson MG. A posteriori and a priori error analysis for finite element approximations of selfadjoint elliptic eigenvalue problems. SIAM J Numer Anal. 2000;38(2):608–25.
 35.
Heuveline V, Rannacher R. A posteriori error control for finite element approximations of elliptic eigenvalue problems. Adv Comput Math. 2001;15(1–4):107–38.
 36.
Durán RG, Padra C, Rodríguez R. A posteriori error estimates for the finite element approximation of eigenvalue problems. Math Models Methods Appl Sci. 2003;13(08):1219–29.
 37.
Mao D, Shen L, Zhou A. Adaptive finite element algorithms for eigenvalue problems based on local averaging type a posteriori error estimates. Adv Comput Math. 2006;25(1–3):135–60.
 38.
Dai X, Xu J, Zhou A. Convergence and optimal complexity of adaptive finite element eigenvalue computations. Numerische Mathematik. 2008;110(3):313–55. https://doi.org/10.1007/s0021100801693.
 39.
Garau EM, Morin P, Zuppa C. Convergence of adaptive finite element methods for eigenvalue problems. Math Models Methods Appl Sci. 2009;19(05):721–47.
 40.
Houston P, Senior B, Süli E. Sobolev regularity estimation for hpadaptive finite element methods. In: Brezzi F, Buffa A, Corsaro S, Murli A, editors. Numerical mathematics and advanced applications. Berlin: Springer; 2003. p. 631–56.
 41.
Melenk JM, Wohlmuth BI. On residualbased a posteriori error estimation in hpfem. Adv Comput Math. 2001;15(1–4):311–31. https://doi.org/10.1023/A:1014268310921.
 42.
Heuveline V, Rannacher R. Dualitybased adaptivity in the hpfinite element method. J Numer Math Jnma. 2003;11(2):95–113.
 43.
Giani S, Grubišić L, Ovall JS. Benchmark results for testing adaptive finite element eigenvalue procedures. Appl Numer Math. 2012;62(2):121–40.
 44.
Bangerth W. The deal.II library tutorial step 27 (version 8.3). 2007. https://www.dealii.org/8.3.0/doxygen/deal.II/step_27.html. Accessed Jan 2016.
 45.
Schauer V, Linder C. Allelectron Kohn–Sham density functional theory on hierarchic finite element spaces. J Comput Phys. 2013;250:644–64. https://doi.org/10.1016/j.jcp.2013.04.020.
 46.
Ciarlet PG. The finite element method for elliptic problems. Amsterdam: Elsevier; 1978.
 47.
Ming P, Shi ZC. Quadrilateral mesh revisited. Comput Methods Appl Mech Eng. 2002;191(49):5671–82.
 48.
Veeser A, Verfürth R. Poincaré constants for finite element stars. IMA J Numer Anal. 2012;32(1):30–47. https://doi.org/10.1093/imanum/drr011.
 49.
Verfürth R. Error estimates for some quasiinterpolation operators. ESAIM Math Model Numer Anal. 1999;33(04):695–713.
 50.
Ainsworth M, Oden JT. A posteriori error estimation in finite element analysis. Comput Methods Appl Mech Eng. 1997;142:1–88.
Author's contributions
DD developed the concepts proposed and discussed in this manuscript, performed the numerical implementation and experiments and wrote the draft of this paper. TG derived local interpolation error estimates and improved the mathematical introduction of the problem. JPP contributed to the numerical implementation and paper revisions, and PS revised the paper. All authors read and approved the final manuscript.
Acknowledgements
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Availability of data and materials
Not applicable.
Consent for publication
Not applicable.
Ethics approval and consent to participate
Not applicable.
Funding
The support of this work by the ERC Advanced Grant 289049 MOCOPOLY (DD, JP, PS) and German Science Foundation (Deutsche ForschungsGemeinschaft, DFG), Grant DA 1664/21 (DD) is gratefully acknowledged. Second author (TG) is supported by the European Research Council (ERC) Starting Researcher Grant INTERFACES, Grant Agreement No. 279439.
Author information
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Local interpolation error estimates
In this appendix, the local interpolation error estimates required for the derivation of the error indicator (7) in the case of PUM are obtained for linear finite element approximations enriched with \( f(\mathbf{x }) = \exp {(\mu \,\left\mathbf{x } \right^p)}\), where \(0 < \mu \in \mathbb {R}\) and \(1 \le p \in \mathbb {N}\). These are
where, as usual, \(v:\Omega \rightarrow \mathbb {R}\) is a scalarvalued function, which is assumed to be at least in \(H^1(\Omega )\), \(q^h\) is a quasiinterpolation operator (of the averaging type), K is an element of the discretization \(\mathcal {P}^h\) of \(\Omega \), \(e\subset \partial K\) is an edge of K. Also, \(h_K\) measures the size of K, \(\omega _K\) is the patch of elements neighboring K including K itself. Finally, \(c_K,c_e\in \mathbb {R}\) are the interpolation constants independent of the mesh size.
We fix the notations to be used throughout the appendix and make assumptions that are conventional for this kind of analysis. For the sake of simplicity and without loss of generality, we elaborate here for the twodimensional setting. The obtained results are valid in three dimensions as well.
First, we assume that the partition \(\mathcal {P}^h\) of \(\Omega \subset \mathbb {R}^2\) consisting of open and convex quadrilaterals K is shaperegular (or nondegenerate), as well as locally quasiuniform in the sense of [46, 47]. For every K and its edge e we define \(h_K:=\mathrm {diam}(K)\) and \(h_e:=e\) is the length of e. For every node i in \(\mathcal {P}^h\) we denote by \(\omega _i\) the union of quadrilaterals connected to node i and set \(h_{\omega _i}:=\mathrm {diam}(\omega _i)\). Furthermore, for every K, \(\omega _K\) represents the patch containing K and the first row of its neighbors; it is then set \(h_{\omega _K}:=\mathrm {diam}(\omega _K)\).
Also, in what follows, by the notation \(a\lesssim b\) we imply the existence of a positive constant C independent of a and b such that \(a\le Cb\). Then \(a\sim b\) means that \(a\lesssim b\) and \(a\gtrsim b\) hold simultaneously. The symbol \(\cdot \) will be used to denote either the \(H^1\)seminorm (as e.g. in (12) and (13)) or the length of a linear segment in \(\mathbb {R}^2\) or the area of a plane domain in \(\mathbb {R}^2\). With these notations at hand, one can show that \(K^\frac{1}{2}\sim h_K\), \(\omega _i^\frac{1}{2}\sim h_{\omega _i}\) and \(\omega _K^\frac{1}{2}\sim h_{\omega _K}\). Furthermore, the shape regularity of the mesh \(\mathcal {P}^h\) ensures that \(h_e\sim h_K\), whereas its local quasiuniformity implies that \(h_K\sim h_{\omega _i}\sim h_{\omega _K}\).
Finally, we also recall useful inequalities, which are

the Poincarétype inequality (see e.g. [48]):
$$\begin{aligned} \left\ v\frac{1}{\omega }\int _\omega v\; d{\mathbf{x }}\right\ _{L^2(\omega )}\le \frac{h_\omega }{\pi } \left v\right _{H^1(\omega )}, \quad \forall v\in H^1(\omega ), \end{aligned}$$(14)where \(\omega \subset \mathbb {R}^n\) (\(n=2,3\)) is a Lipschitz domain and \(h_\omega :=\mathrm {diam}(\omega )\);

the scaled trace inequality (e.g. in [49], Lemma 3.2):
$$\begin{aligned} \left\ v\right\ _{L^2(e)} \lesssim h_e^{\frac{1}{2}}\left\ v\right\ _{L^2(K)}+h_e^\frac{1}{2}\left v\right _{H^1(K)}, \quad \forall v\in H^1(K). \end{aligned}$$(15)
Quasiinterpolation operator
Herein, we construct an interpolation operator for obtaining the local error estimates (12) and (13).
Let \(V:=H^1(\Omega )\) be an admissible space and \(V^h\) be its (enriched) finite element counterpart
where \(I^\star \) is the set of all enriched nodes of \(\mathcal {P}^h\) and \(I^\mathrm {std.}\) is the set of standard, i.e. nonenriched nodes of \(\mathcal {P}^h\); \(I^\star \cap I^\mathrm {strd.} = \emptyset \). Recall also that \( N_i\) in our case is the \(Q_1\)shape function associated with node i and supported on \(\omega _i\).
Explicit construction of the operator \(q^h:V\rightarrow V^h\) implies the explicit pattern of assignments of \(a_i,b_i,c_i\in \mathbb {R}\) through a function \(v\in V\). In the case of the enriched FE approximation (16), the major challenge in deriving \(q^h\) is imposition of the constantpreserving property on \(q^h\), which should be fulfilled on every element \(K\in \mathcal {P}^h\) regardless the element type (see Fig. 7).
The operator \(q^h:V\rightarrow V^h\) with the desired property reads as follows:
with all notations as in (16) and where \({\mathbf{x }}_i\), entering the second term, denotes the coordinate of a node i. Below, for the proposed quasiinterpolation operator of the averaging type \(q^h\) we establish that \(q^h c{_K}=c\) on a standard element (note this is a classical result for a nonenriched FEM) and, more importantly, that \(q^h c{_K}= c+\mathcal {{O}}(h_K^p)\) on a fullyenriched and a blended element.
Estimates
Preliminaries
The three estimates that we start with are basic for the following local interpolation error analysis. On every \(K\in \mathcal {P}^k\) and its node i it holds that
and
Results (18) rigorously follow from the isoparametric concept and related properties, see e.g. [50] for details. We note that they may be also derived in a less rigorous manner owing to a boundedness of the basis function \( N_i\) on K along with \(K^\frac{1}{2}\sim h_K\) and \(e^\frac{1}{2}=h_e^\frac{1}{2}\sim h_K^\frac{1}{2}\).
The inequality (19) is obtained as follows:
Here we used the Cauchy–Schwarz inequality, \(\omega _i^\frac{1}{2}\sim h_{\omega _i} \sim h_K\) and also the extensionrelated result \(\left\ v \right\ _{L^2(\omega _i)}\le \left\ v \right\ _{L^2(\omega _K)}\).
Finally, to show (20) we explicitly use the properties of \(f(\mathbf{x })\). For any fixed K, \({\mathbf{x }}\in K\) and \({\mathbf{x }}_i\in K\) being one of its nodes, we have the following upper bound estimate:
Notice that due to boundedness of \(\min _{\mathbf{x }\in \overline{K}}\mathbf{x }\) for a given fixed K, there always exists \(\epsilon >0\) such that \(\min _{\mathbf{x }\in \overline{K}}\mathbf{x }=\epsilon h_K\). Using this in (21), we obtain
yielding, as a result, \(\frac{f({\mathbf{x }})}{f({\mathbf{x }}_i)}\le 1+\mathcal {{O}}(h_K^p)\).
The lower bound estimate can be found similarly:
and, eventually, \(\frac{f({\mathbf{x }})}{f({\mathbf{x }}_i)}\ge 1+\mathcal {{O}}(h_K^p)\). The result (20) then follows.
Stability of \(q^h\) in \(L^2\)norm
The next step towards (12) and (13) implies obtaining the socalled stability result for the constructed \(q^h\). Using (18)–(20) one straightforwardly shows that
and
These estimates indeed hold for every K regardless of its type (standard, blended, enriched). Note that for a standard nonenriched FEM and the resulting interpolation operators, the estimates (22) and (23) are classical. We have obtained and proved them for our specific operator \(q^h\) adopted for the current enriched FEM setting.
Constantpreserving property of \(q^h\)
The final ingredient required for obtaining (12) and (13) is the determination of how “well” the constructed \(q^h\) reproduces the constant on an element K, depending on its type. This constantpreserving property of the operator is of major importance particularly in the case of enriched FEM.
The required result on a standard (nonenriched) element K follows immediately. Indeed, in this case
and the partition of unity \(\sum _{i=1}^{4} N_i({\mathbf{x }})=1\) on K yields \(q^h c_K=c\), \(c=\mathrm {const}\).
The situation on a fullyenriched and partlyenriched (blended) element is more delicate. In the case of a fully enriched element we have
that, owing to (20), results in
Now, let K be a blended element, implying the representation:
where \(\ell \in \{1,2,3\}\) is the number of enriched nodes of K. Adding and subtracting the first sum in the above expression, enables us to rewrite it as follows:
Note that the last term contains the summation over all four nodes and is the standard (nonenriched) FE contribution which will automatically reproduce a constant. We then need to estimate, in this context, the remaining part constituting of the first and the second sums. We obtain,
where (20) was also used.
Proof of local error estimates (12), (13)
The derivation of the estimates for \(\left\ vq^h v\right\ _{L^2(K)}\) and \(\left\ vq^h v\right\ _{L^2(e)}\) is based on a combined use of the above stability results for \(q^h\), the Poincaré and the scaled trace inequalities (14) and (15), respectively, as well as the constantpreserving property results. First, due to linearity of \(q^h\), we have
where \(c=\mathrm {const}\) and where, for the sake of brevity, we set \(\sigma =\{K,e\}\). We are now in a position to dissect every term in (24) in either case of \(\sigma \).
When \(\sigma ={{K}}\) in (24):
By the Poincaré inequality (14), it holds that
where one can choose \(c=\omega _K^{1}\int _{\omega _K} v {\mathrm{d}}{\mathbf{x }}\) and use \(h_{\omega _K}\sim h_K\).
By the stability estimate (22) and the Poincaré inequality, it holds similarly to the above that
Furthermore, using the results of “Constantpreserving property of \(q^h\)” section we obtain
and
In the former case we also use that \(\left\ 1 \right\ _{L^2(K)}=K^\frac{1}{2}\sim h_K\).
Using (25)–(28) in (24), the resulting local interpolation error of type (12) follows. Note that in the case of fully enriched and blended elements the term \(\mathcal {{O}}(h_K^{p+1})\) that appears in the corresponding upper bound can be neglected, being the higher order term with respect to the leading one \(h_K \left v\right _{H^1(\omega _K)}\).
When \(\sigma ={{e}}\) in (24):
By the scaled trace inequality (15), it holds
where we also use \(h_e\sim h_K\) along with result in (25).
By the stability estimate (23) and the Poincaré inequality (14), we obtain the result that
Finally, using the results of “Constantpreserving property of \(q^h\)” section we derive
and
In the former case we also use the fact that \(\left\ 1 \right\ _{L^2(e)}=e^\frac{1}{2}=h_e^\frac{1}{2}\sim h_K^\frac{1}{2}\).
Using (29)–(32) in (24), the resulting local interpolation error estimate of type (13) follows as well. Again, in the case of fully enriched and blended elements the term \(\mathcal {{O}}(h_K^\frac{3}{2})\) that appears in the corresponding upper bound can be neglected, being the higher order term with respect to the leading one \(h_K^\frac{1}{2} \left v\right _{H^1(\omega _K)}\).
Appendix B: Single atom radial solution
The radial solution of a single atom with charge Z is obtained by solving the following coupled problem
where n and l are the main and azimuthal quantum numbers, \(f_{nl}\) are occupation numbers, V is the effective potential and \(R^\psi _{rl}\) and \(R^\phi \) are respectively radial components of the eigenfunctions and electrostatic potential. The radial component of the eigenfunctions are normalized by \(\int _0^\infty r^2 (R^\psi _{nl})^2 \mathrm{dr} = 1\). On the change of variables \(U^\psi _{nl} := r\,R^\psi _{nl}\) and \(U^\phi := r\, R^\phi \), the system takes the form
which together with the following Dirichlet boundary conditions
can be solved using the standard finite element method in a sufficiently large but finite domain. The eigenfunctions are then given by \(\psi _{nlm} = R^\psi _{nl} Y_{lm}\), where \(Y_{lm}\) are spherical harmonics.
Appendic C: PUM implementational details
An enriched finite element class has been implemented for the general purpose objectoriented C++ finite element library deal.II [30]. The implementation is based on the FESystem class, which is used to build finite elements for vector valued problems from a list of base (scalar) elements. What differs from that class is that the developed FE implementation is scalar, but built from a collection of base elements and enrichment functions^{Footnote 9}
where I is the set of all DoFs with standard shape functions (see Fig. 8a), \(I^{\mathrm{pum}}_k\) is the set of all DoFs corresponding to shape functions enriched with \(f_k(\mathbf{x })\) (see Fig. 8b) and S is the set of enrichment functions.
As distribution of DoFs in deal.II is element based, we always enrich all DoFs on the element. To restore \(C^0\) continuity between enriched and nonenriched elements, additional algebraic constraints are added to force DoFs \(\widetilde{u}_{jk}\) associated with \(N_{jk} f_k\) on the face between the enriched and nonenriched elements to be zero. This is equivalent to enriching only those shape functions whose support is contained within the enriched elements.
The hrefinement in deal.II is implemented using hanging nodes. In this case, extra algebraic constraints have to be added to make the resulting field conforming. We build these constraints separately for the nonenriched FE shape functions and enriched shape functions; that is, the following spaces are separately made conforming: \(\{ N_i(\mathbf{x })\}\), \(\{N_{j0}(\mathbf{x })\}\), \(\{N_{j1}(\mathbf{x })\}\), etc. To illustrate this idea consider two separate FE spaces shown in Fig. 8. We assume that functions in the first space are nonzero everywhere in the domain, whereas functions in the second space are nonzero only in the left part, marked by the blue shading. Therefore we do not have to introduce any DoFs in the right part, the underlying elements are denoted by \(Q_{\mathrm{zero}}\). The standard procedure implemented in deal.II [27] will enforce continuity of the vector field by introducing algebraic constraints for DoFs associated with hanging nodes^{Footnote 10} (3, 5, 17, 19), plus constraints for DoFs 14, 16, 22 to make functions in the second FE space zero at the interface between \(Q_1\) and \(Q_{\mathrm{zero}}\). We can observe now that if we take the constrained scalar field from the first FE space and add a scalar field from the second FE space multiplied by the enrichment functions \(f(\mathbf{x })\) (continuous in space), the resulting scalar FE field will also be continuous. Thus we arrive at a conforming hadaptive PUM space where only some elements are enriched. With reference to Fig. 8, the resulting PUM field will have enrichment associated with DoFs 23, 24, 20, 21, 17, 18, 15 whereas DoFs 22, 19, 16, 14, 17 will be constrained.
In this procedure the algebraic constraints do not depend on the enrichment functions and are equivalent to those one would have for the vectorvalue bases build upon the same list of scalar FEs. Therefore, no extension of the existing functionality to build algebraic constraints was necessary. This allows us to reuse the code written for the FESystem class, which can be used in deal.II to build a vectorvalued FE from a collection of scalarvalued elements. Another remarkable benefit of this approach is that existing code can be used to transfer the solution during h adaptive refinement from a coarse to a fine mesh. The reason is that prolongation matrices for enriched elements are equal to their vectorvalued counterparts under the condition that all child elements are also enriched. Yet another advantage of implementing a dedicated enriched finite element in deal.II library relates to the numerical integration of jump terms in the Kelly error indicator (see “Error estimator” section). Here, care needs to be taken in computing contributions to cell errors from faces with hanging nodes. Had the authors pursued an implementation of PUM where values and gradients of additional basis functions are evaluated manually via the product rule in the course of numerical integration, a completely separate function would have to be implemented to integrate the jump terms in error indicators, which is not a straightforward task. We believe that the implementation outlined above is general enough to allow PUM to be applied using deal.II to other partial differential equations such as crack propagation in continuum mechanics. Figure 9 depicts an example of enriched and nonenriched shape functions for the case of hadaptive refinement with hanging nodes in two dimensions.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Davydov, D., Gerasimov, T., Pelteret, J. et al. Convergence study of the hadaptive PUM and the hpadaptive FEM applied to eigenvalue problems in quantum mechanics. Adv. Model. and Simul. in Eng. Sci. 4, 7 (2017). https://doi.org/10.1186/s4032301700930
Received:
Accepted:
Published:
Keywords
 Adaptive finite element method
 Partitionofunity method
 Error estimators
 Schrödinger equation
 Local interpolation error estimates
 Density functional theory