H. Gharibnejad, B. Schneider, M. Leadingham, H. J. Schmale
{"title":"一维时变Schr\\ odinger解的数值方法比较。","authors":"H. Gharibnejad, B. Schneider, M. Leadingham, H. J. Schmale","doi":"10.1002/HTTPS://DOI.ORG/10.1016/J.CPC.2019.05.019","DOIUrl":null,"url":null,"abstract":"We examine the performance of various time propagation schemes using a one-dimensional model of the hydrogen atom. In this model the exact Coulomb potential is replaced by a soft-core interaction. The model has been shown to be a reasonable representation of what occurs in the fully three-dimensional hydrogen atom. Our results show that while many numerically simple (low order) propagation schemes work, they often require quite small time-steps. Comparing them against more accurate methods, which may require more work per time-step but allow much larger time-steps, can be illuminating. We show that at least in this problem, the compute time for a number of the more accurate methods is actually less than lower order schemes. Finally, we make some remarks on what to expect in generalizing our findings to more than one dimension.","PeriodicalId":8424,"journal":{"name":"arXiv: Computational Physics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparison of Numerical Approaches to the Time-Dependent Schr\\\\\\\"odinger Solutions in One Dimension.\",\"authors\":\"H. Gharibnejad, B. Schneider, M. Leadingham, H. J. Schmale\",\"doi\":\"10.1002/HTTPS://DOI.ORG/10.1016/J.CPC.2019.05.019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine the performance of various time propagation schemes using a one-dimensional model of the hydrogen atom. In this model the exact Coulomb potential is replaced by a soft-core interaction. The model has been shown to be a reasonable representation of what occurs in the fully three-dimensional hydrogen atom. Our results show that while many numerically simple (low order) propagation schemes work, they often require quite small time-steps. Comparing them against more accurate methods, which may require more work per time-step but allow much larger time-steps, can be illuminating. We show that at least in this problem, the compute time for a number of the more accurate methods is actually less than lower order schemes. Finally, we make some remarks on what to expect in generalizing our findings to more than one dimension.\",\"PeriodicalId\":8424,\"journal\":{\"name\":\"arXiv: Computational Physics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Computational Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/HTTPS://DOI.ORG/10.1016/J.CPC.2019.05.019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Computational Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/HTTPS://DOI.ORG/10.1016/J.CPC.2019.05.019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparison of Numerical Approaches to the Time-Dependent Schr\"odinger Solutions in One Dimension.
We examine the performance of various time propagation schemes using a one-dimensional model of the hydrogen atom. In this model the exact Coulomb potential is replaced by a soft-core interaction. The model has been shown to be a reasonable representation of what occurs in the fully three-dimensional hydrogen atom. Our results show that while many numerically simple (low order) propagation schemes work, they often require quite small time-steps. Comparing them against more accurate methods, which may require more work per time-step but allow much larger time-steps, can be illuminating. We show that at least in this problem, the compute time for a number of the more accurate methods is actually less than lower order schemes. Finally, we make some remarks on what to expect in generalizing our findings to more than one dimension.