用傅里叶谱方法求解克莱因-戈尔登方程:一种计算机性能的基准测试
Solving the Klein-Gordon equation using Fourier spectral methods: A benchmark test for computer performance
AI总结:
本文利用傅里叶谱方法求解克莱因-戈尔登方程,并在不同机器上测试其强标度性能,以评估并行快速傅里叶变换程序在求解偏微分方程中的表现。
摘要:
立方克莱因-戈尔登方程是一个简单但非平凡的偏微分方程,其数值解是求解许多其他偏微分方程所需的基本构建块。本文使用2DECOMP&FFT库在傅里叶谱方案中求解克莱因-戈尔登方程,并在13种不同机器上对问题规模为512^3的代码进行强标度测试。结果有助于评估其他基于并行快速傅里叶变换程序在求解偏微分方程中的性能。该问题足够大,可以在工作站上求解,但同时也适合在超级计算机上快速求解,特别是在参数研究中。与其他高性能计算基准不同,对于该问题规模,仅通过构建更大的超级计算机并不能提高求解时间。
英文摘要:
The cubic Klein-Gordon equation is a simple but non-trivial partial differential equation whose numerical solution has the main building blocks required for the solution of many other partial differential equations. In this study, the library 2DECOMP&FFT is used in a Fourier spectral scheme to solve the Klein-Gordon equation and strong scaling of the code is examined on thirteen different machines for a problem size of 512^3. The results are useful in assessing likely performance of other parallel fast Fourier transform based programs for solving partial differential equations. The problem is chosen to be large enough to solve on a workstation, yet also of interest to solve quickly on a supercomputer, in particular for parametric studies. Unlike other high performance computing benchmarks, for this problem size, the time to solution will not be improved by simply building a bigger supercomputer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。