Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulatio
文献类型：期刊论文
| 作者 | Zhao, Tao; Hwang, Feng-Nan; Cai, Xiao-Chuan |
| 刊名 | COMPUTER PHYSICS COMMUNICATIONS
 |
| 出版日期 | 2016 |
| 英文摘要 | We consider a quintic polynomial eigenvalue problem arising from the finite volume discretization of a quantum dot simulation problem. The problem is solved by the Jacobi-Davidson (JD) algorithm. Our focus is on how to achieve the quadratic convergence of JD in a way that is not only efficient but also scalable when the number of processor cores is large. For this purpose, we develop a projected two-level Schwarz preconditioned JD algorithm that exploits multilevel domain decomposition techniques. The pyramidal quantum dot calculation is carefully studied to illustrate the efficiency of the proposed method. Numerical experiments confirm that the proposed method has a good scalability for problems with hundreds of millions of unknowns on a parallel computer with more than 10,000 processor cores. |
| 收录类别 | SCI |
| 原文出处 | http://www.sciencedirect.com/science/article/pii/S0010465516300674 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/10283]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | COMPUTER PHYSICS COMMUNICATIONS |
| 推荐引用方式 GB/T 7714 | Zhao, Tao,Hwang, Feng-Nan,Cai, Xiao-Chuan. Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulatio[J]. COMPUTER PHYSICS COMMUNICATIONS,2016. |
| APA | Zhao, Tao,Hwang, Feng-Nan,&Cai, Xiao-Chuan.(2016).Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulatio.COMPUTER PHYSICS COMMUNICATIONS. |
| MLA | Zhao, Tao,et al."Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulatio".COMPUTER PHYSICS COMMUNICATIONS (2016). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。