Abstract
In this paper, we propose a decomposition approach to differential eigenvalue problems with Abelian or non-Abelian symmetries. In the approach, we divide the original differential problem into eigenvalue subproblems which require less eigenpairs and can be solved independently. Our approach can be seamlessly incorporated with grid-based discretizations such as finite difference, finite element, or finite volume methods. We place the approach into a two-level parallelization setting, which saves the CPU time remarkably. For illustration and application, we implement our approach with finite elements and carry out electronic structure calculations of some symmetric cluster systems, in which we solve thousands of eigenpairs with millions of degrees of freedom and demonstrate the effectiveness of the approach.
Similar content being viewed by others
Notes
In [6], \(\varSigma _g\) is the “internal” boundary \(\partial \varOmega _0\setminus \partial \varOmega \) of \(\varOmega _0\), and irreducible subdomain \(\varOmega _0\) is called symmetry cell.
Cubic crystals are crystals where the unit cell is a cube. All irreducible representations of the associated symmetry group are one-, two-, or three-dimensional.
Symmetry element of operation \(R\) is a point of reference about which \(R\) is carried out, such as a point to do inversion, a rotation axis, or a reflection plane. Symmetry element is invariant under the associated symmetry operation.
We count the average CPU time of a single iteration for each subproblem and then accumulate them. Taking Table 4 for example, we have that \(4.73=17.95/32 + 15.53/26 + 14.88/25 + 14.59/24 + 15.95/28 + 15.78/27 + 14.17/23 + 14.92/25\).
The configuration is visualized by PyMOL.
References
Ackermann, J., Erdmann, B., Roitzsch, R.: A self-adaptive multilevel finite element method for the stationary Schrödinger equation in three space dimensions. J. Chem. Phys. 101, 7643–7650 (1994)
Agmon, S.: Lectures on the Exponential Decay of Solutions of Second-Order Elliptic Operators. Princeton University Press, Princeton (1981)
Banjai, L.: Eigenfrequencies of fractal drums. J. Comput. Appl. Math. 198, 1–18 (2007)
Beck, T.L.: Real-space mesh techniques in density-functional theory. Rev. Mod. Phys. 72, 1041–1080 (2000)
Bossavit, A.: Symmetry, groups, and boundary value problems. A progressive introduction to noncommutative harmonic analysis of partial differential equations in domains with geometrical symmetry. Comput. Methods Appl. Mech. Eng. 56, 167–215 (1986)
Bossavit, A.: Boundary value problems with symmetry, and their approximation by finite elements. SIAM J. Appl. Math. 53, 1352–80 (1993)
Chelikowsky, J.R., Troullier, N., Saad, Y.: Finite-difference-pseudopotential method: electronic structure calculations without a basis. Phys. Rev. Lett. 72, 1240–1243 (1994)
Cornwell, J.F.: Group Theory in Physics: An Introduction. Academic Press, California (1997)
Cotton, F.A.: Chemical Applications of Group Theory, 3rd edn. Wiley-Interscience, New York (1990)
Dai, X., Gong, X., Yang, Z., Zhang, D., Zhou, A.: Finite volume discretizations for eigenvalue problems with applications to electronic structure calculations. Multiscale Model. Simul. 9, 208–240 (2011)
Fang, J., Gao, X., Zhou, A.: A Kohn–Sham equation solver based on hexahedral finite elements. J. Comput. Phys. 231, 3166–3180 (2012)
Fattebert, J.-L., Hornung, R.D., Wissink, A.M.: Finite element approach for density functional theory calculations on locally-refined meshes. J. Comput. Phys. 223, 759–773 (2007)
Friesecke, G., Goddard, B.D.: Asymptotics-based CI models for atoms: properties, exact solution of a minimal model for Li to Ne, and application to atomic spectra. Multiscale Model. Simul. 7, 1876–1897 (2009)
Gårding, L.: On the essential spectrum of Schrödinger operators. J. Funct. Anal. 52, 1–10 (1983)
Genovese, L., Neelov, A., Goedecker, S., Deutsch, T., Ghasemi, S.A., Willand, A., Caliste, D., Zilberberg, O., Rayson, M., Bergman, A., Schneider, R.: Daubechies wavelets as a basis set for density functional pseudopotential calculations. J. Chem. Phys. 129, 014109 (2008)
Golub, G.H., van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)
Gull, E., Millis, A.J., Lichtenstein, A.I., Rubtsov, A.N., Troyer, M., Werner, P.: Continuous-time Monte Carlo methods for quantum impurity models. Rev. Mod. Phys. 83, 349–404 (2011)
Gong, X., Shen, L., Zhang, D., Zhou, A.: Finite element approximations for Schrödinger equations with applications to electronic structure computations. J. Comput. Math. 23, 310–327 (2008)
Hasegawa, Y., Iwata, J.-I., Tsuji, M., Takahashi, D., Oshiyama, A., Minami, K., Boku, T., Shoji, F., Uno, A., Kurokawa, M., Inoue, H., Miyoshi, I., Yokokawa M.: First-principles calculations of electron states of a silicon nanowire with 100,000 atoms on the K computer. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC2011), pp. 1–11 (2011)
Haule, K.: Quantum Monte Carlo impurity solver for cluster dynamical mean-field theory and electronic structure calculations with adjustable cluster base. Phys. Rev. B 75, 155113 (2007)
Hohenberg, P., Kohn, W.: Inhomogeneous electron gas. Phys. Rev. B 136((3B)), B864–B871 (1964)
Kohn, W., Sham, L.J.: Self-consistent equations including exchange and correlation effects. Phys. Rev. 140((4A)), A1133–A1138 (1965)
Kronik, L., Makmal, A., Tiago, M.L., Alemany, M.M.G., Jain, M., Huang, X., Saad, Y., Chelikowsky, J.R.: Parsec—the pseudopotential algorithm for real-space electronic structure calculations: recent advances and novel applications to nano-structures. Phys. Stat. Sol. B. 243, 1063–1079 (2006)
Kuttler, J.R., Sigillito, V.G.: Eigenvalues of the Laplacian in two dimensions. SIAM Rev. 26, 163–193 (1984)
Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK Users’ Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia (1998)
Martin, R.M.: Electronic Structure: Basic Theory and Practical Methods. Cambridge University Press, Cambridge (2004)
Mendl, C.B., Friesecke, G.: Efficient algorithm for asymptotics-based configuration-interaction methods and electronic structure of transition metal atoms. J. Chem. Phys. 133, 184101 (2010)
Mo, Z., Zhang, A., (eds.): User’s guide for JASMIN Technical Report No. T09-JMJL-01. http://www.iapcm.ac.cn/jasmin (2009)
Neuberger, J.M., Sieben, N., Swift, J.W.: Computing eigenfunctions on the Koch Snowflake: a new grid and symmetry. J. Comput. Appl. Math. 191, 126–142 (2006)
Ono, T., Hirose, K.: Real-space electronic-structure calculations with a time-saving double-grid technique. Phys. Rev. B. 72, 085115 (2005)
Pask, J.E., Sterne, P.A.: Finite element methods in ab initio electronic structure calculations. Model. Simul. Mater. Sci. Eng. 13, 71–96 (2005)
Simon, B.: Schrödinger operators in the twentieth century. J. Math. Phys. 41, 3523–3555 (2000)
Suryanarayana, P., Gavini, V., Blesgen, T.: Non-periodic finite-element formulation of Kohn–Sham density functional theory. J. Mech. Phys. Solids 58, 256–280 (2010)
Tinkham, M.: Group Theory and Quantum Mechanics. McGraw-Hill, New York (1964)
Torsti, T., Eirola, T., Enkovaara, J., Hakala, T., Havu, P., Havu, V., Höynälänmaa, T., Ignatius, J., Lyly, M., Makkonen, I., Rantala, T.T., Ruokolainen, J., Ruotsalainen, K., Räsänen, E., Saarikoski, H., Puska, M.J.: Three real-space discretization techniques in electronic structure calculations. Phys. Stat. Sol. B243, 1016–1053 (2006)
Trefethen, L.N., Betcke, T., Computed eigenmodes of planar regions. In: Recent advances in differential equations and mathematical physics, volume 412 of Contemp. Math., pp. 297–314. Providence, RI, Amer. Math. Soc (2006)
Tsuchida, E., Tsukada, M.: Electronic-structure calculations based on the finite-element method. Phys. Rev. B. 52, 5573–5578 (1995)
White, S.R., Wilkins, J.W., Teter, M.P.: Finite-element method for electronic structure. Phys. Rev. B. 39, 5819–5833 (1989)
Wohlever, J.C.: Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells-of-revolution. Comput. Methods Appl. Mech. Eng. 170, 373–406 (1999)
Xia, F., Chen, H., Song, L., Shen, W.: Design and implementation of numerical simulation mesh data model. J. Comput. Res. Develop. 46((Supp. I)), 258–264 (2009). (in Chinese)
Zhang, D., Shen, L., Zhou, A., Gong, X.: Finite element method for solving Kohn-Sham equations based on self-adaptive tetrahedral mesh. Phys. Lett. A. 372, 5071–5076 (2008)
Zienkiewicz, O.C., Taylor, R.L.: The Finite Element Method for Solid and Structural Mechanics, 6th edn. Elsevier, London (2005)
Zingoni, A.: Group-theoretic exploitations of symmetry in computational solid and structural mechanics. Int. J. Numer. Methods Eng. 79, 253–289 (2009)
Acknowledgments
The authors would like to thank Prof. Xiaoying Dai, Prof. Xingao Gong, Prof. Lihua Shen, Dr. Zhang Yang, and Mr. Jinwei Zhu for their stimulating discussions on electronic structure calculations. The second author is grateful to Prof. Zeyao Mo for his encouragement. The authors would also like to thank the referee for his/her constructive comments and suggestions that improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the National Science Foundation of China under Grant 61170310, the Funds for Creative Research Groups of China under Grant 11021101, the National Basic Research Program of China under Grants 2011CB309702 and 2011CB309703, and the National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences.
Appendices
Appendix 1: Basic Concept of Group Theory
In this appendix, we include some basic concepts of group theory for a more self-contained exposition. They could be found in standard textbooks like [8, 9, 34].
A group \(G\) is a set of elements \(\{R\}\) with a well-defined multiplication operation which satisfy the following requirements:
-
1.
The set is closed under the multiplication.
-
2.
The associative law holds.
-
3.
There exists a unit element \(E\) such that \(ER=RE=R\) for any \(R\in G\).
-
4.
There is an inverse \(R^{-1}\) in \(G\) to each element \(R\) such that \(RR^{-1} = R^{-1}R = E\).
If the commutative law of multiplication also holds, \(G\) is called an Abelian group. Group \(G\) is called a finite group if it contains a finite number of elements. And this number, denoted by \(g\), is said to be the order of the group. The rearrangement theorem tells that the elements of \(G\) are only rearranged by multiplying each by any \(R\in G\), i.e., \(RG=G\) for any \(R\in G\).
An element \(R_1\in G\) is called to be conjugate to \(R_2\) if \(R_2=SR_1S^{-1}\), where \(S\) is some element in the group. All the mutually conjugate elements form a class of elements. It can be proved that group \(G\) can be divided into distinct classes. Denote the number of classes as \(n_c\). In an Abelian group, any two elements are commutative, so each element forms a class by itself, and \(n_c\) equals the order of the group.
Groups \(G=\{R\}\) and \(G^{\prime }=\{R^{\prime }\}\) are called to be homomorphic, if there exists a correspondence between the elements of \(G\) and \(G^{\prime }\) as \(R\leftrightarrow R^{\prime }_1,R^{\prime }_2,\ldots \), which means that if \(RS=T\) then the product of any \(R^{\prime }_i\) with any \(S^{\prime }_j\) will belong to the set \(\{T^{\prime }_1,T^{\prime }_2,\ldots \}\). This is a many-to-one correspondence in general. If the correspondence specializes to be one-to-one, the two groups are called to be isomorphic.
A matrix representation of group \(G\) means a group of matrices which is homomorphic to \(G\). Two representations are said to be equivalent if they are associated by a similarity transformation. If a representation can not be equivalent to representations of lower dimensionality, it is called irreducible. Any matrix representation with nonzero determinants is equivalent to a unitary representation, i.e., a representation by unitary matrices.
The number of all the inequivalent, irreducible, unitary representations is equal to \(n_c\), which is the number of classes in \(G\). The Celebrated Theorem tells that
where \(d_{\nu }\) denotes the dimensionality of the \(\nu \)th representation. Since the number of classes of an Abelian group equals the number of elements, an Abelian group of order \(g\) has \(g\) one-dimensional irreducible representations.
The groups used in this paper are all crystallographic point groups. Groups \(D_2,\;D_{2h},\;D_{2d}\) and \(D_4\) are four dihedral groups; the first two groups are Abelian and the other two are non-Abelian. In Tables 2 and 7, \(C_{nj}\) denotes a rotation about axis \(Oj\) by \(2\pi /n\) in the right-hand screw sense and \(I\) is the inversion operation [8]. The \(Oj\) axes are illustrated in Fig. 6. We refer to textbooks like [8, 9, 34] for more details about crystallographic point groups.
Appendix 2: Proof of Proposition 2
Proof
(a) Since \(\{P_R\}\) are unitary operators, we have
which together with the fact that \(\varGamma ^{(\nu )}\) is a unitary representation derives
(b) It follows from the definition that
Note that the rearrangement theorem implies that, when \(S\) runs over all the group elements, \(S^{\prime }=RS\) for any \(R\) also runs over all the elements. Hence we get
We may calculate as follows
which together with the great orthogonality theorem yields
Thus we arrive at
\(\square \)
Appendix 3: An Example
We take the Laplacian in square \((-1,1)^2\) as an example to illustrate the subproblem formulation in Corollary 2. Namely, we consider the decomposition of the following eigenvalue problem
Note that \(G=\{E,\sigma _x,\sigma _y,I\}\) is a symmetry group associated with (27), where \(E\) represents the identity operation, \(\sigma _x\) a reflection about \(x\)-axis, \(\sigma _y\) a reflection about \(y\)-axis, and \(I\) the inversion operation. We see that \(G\) is an Abelian group of order 4, and has 4 one-dimensional irreducible representations as shown in Table 9.
According to Theorem 1 and Corollary 2, eigenvalue problem (27) can be decomposed into 4 subproblems (due to \(\sum _{\nu =1}^{n_c}d_{\nu }=4\)). And the symmetry characteristic conditions, the third equation in (13), for the 4 subproblems are
where \(x\in \varOmega \) is an arbitrary point and subscripts of \(\{u_1^{(\nu )}:\nu =1,2,3,4\}\) are omitted.
In Fig. 7, we illustrate four eigenfunctions of (27) belonging to different subproblems. We see that \(u_2\) and \(u_3\) are degenerate eigenfunctions corresponding to \(\lambda =\frac{5}{4}\pi ^2\) with double degeneracy. In other words, a doubly-degenerate eigenvalue of the original problem becomes nondegenerate for subproblems. This implies a relation between symmetry and degeneracy [24, 29, 36]. Moreover, the first subproblem does not have this eigenvalue, which shows that the decomposition approach has improved the spectral separation.
Appendix 4: Spatial Symmetry in Reciprocal Space
Plane wave method is widely used for solving the Kohn–Sham equations of crystals. Actually, plane waves may be regarded as grid-based discretizations in reciprocal space. We will show that the symmetry relation in real space is kept in reciprocal space. The solution domain \(\varOmega \) of crystals can be spanned by three lattice vectors in real space. We denote them as \(\mathbf{a}_i (i=1,2,3)\). If function \(f\) is invariant with integer multiple translations of the lattice vectors, we then present the function in reciprocal space as like:
where \(\mathbf{q}\) is any vector in reciprocal space satisfying \(\mathbf{q}\cdot \mathbf{a}_i=\frac{2\pi n}{N_i}\) with \(n\) an integer, \(N_i\) the number of degrees of freedom along direction \(\mathbf{a}_i~(i=1,2,3)\), and \(N=N_1N_2N_3\) the total number of degrees of freedom. Assume that \(f\) is kept invariant under coordinate transformation \(R\) in \(\varOmega \). We obtain from
and the coordinate transformation \(R\) can be represented as an orthogonal matrix that
Since
we have
Hence the decomposition approach is probably applicable to plane waves.
Rights and permissions
About this article
Cite this article
Fang, J., Gao, X. & Zhou, A. A Symmetry-Based Decomposition Approach to Eigenvalue Problems. J Sci Comput 57, 638–669 (2013). https://doi.org/10.1007/s10915-013-9719-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-013-9719-7