Advertisement

A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation

  • Tao ZhaoEmail author
  • Feng-Nan Hwang
  • Xiao-Chuan Cai
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)

Abstract

In this paper, we develop an overlapping domain decomposition (DD) based Jacobi-Davidson (JD) algorithm for a polynomial eigenvalue problem arising from quantum dot simulation. Both DD and JD have several adjustable components. The goal of the work is to figure out if it is possible to choose the right components of DD and JD such that the resulting approach has a near linear speedup for a fine mesh calculation. Through experiments, we find that the key is to use two different coarse meshes. One is used to obtain a good initial guess that helps to achieve quadratic convergence of the nonlinear JD iterations. The other guarantees scalable convergence of the linear solver of the correction equation. We report numerical experiments carried out on a supercomputer with over 10,000 processors.

Keywords

Finite Volume Method Domain Decomposition Fine Mesh Coarse Mesh Correction Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    P.E. Bjørstad, B.F. Smith, W.D. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. (Cambridge University Press, New York, 1996)Google Scholar
  2. 2.
    K. Buschelman, V. Eijkhout, W.D. Gropp, D. Kaushik, M.G. Knepley, L.C. McInnes, B.F. Smith, S. Balay, J. Brown, H. Zhang, Petsc users manual (Argonne National Laboratory, 2013)Google Scholar
  3. 3.
    X.-C. Cai, M. Sarkis, A restricted additive Schwarz preconditioner for general sparse linear systems. SIAM J. Sci. Comput. 21, 239–247 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    D.R. Fokkema, G.L.G. Sleijpen, A.G.L. Booten, H. van der Vorst, Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT 36, 595–633 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    T.-M. Huang, F.-N. Hwang, Z.-H. Wei, W. Wang, A parallel additive schwarz preconditioned jacobi-davidson algorithm for polynomial eigenvalue problems in quantum dot simulation. J. Comput. Phys. 229, 2923–2947 (2010)MathSciNetzbMATHGoogle Scholar
  6. 6.
    J.E. Roman, V. Hernandez, V. Vidal, SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Softw. 31, 351–362 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd edn. (SIAM, Philadelphia, 2003)CrossRefzbMATHGoogle Scholar
  8. 8.
    N. Vukmirović, L.-W. Wang, Quantum dots: theory. Technical Report, Lawrence Berkeley National Laboratory, 2009Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ColoradoBoulderUSA
  2. 2.Department of MathematicsNational Central UniversityJhongliTaiwan

Personalised recommendations