利用非均匀快速傅里叶变换快速计算静磁场
Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms
AI总结:
针对微磁模拟中静磁场计算瓶颈,提出基于非均匀快速傅里叶变换的算法,将有限元方法的计算复杂度降至N logN,且不损失精度。
摘要:
微磁模拟的瓶颈是长程静磁场的计算。在规则N节点网格上,利用快速傅里叶变换可在N logN时间内处理,而几何上更灵活的有限元方法(FEM)在最佳情况下也受限于N^4/3。我们报告了一种非均匀快速傅里叶变换算法的实现,该算法将N logN收敛性引入FEM,且结果不损失精度。
英文摘要:
The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite element methods (FEM) are bounded to N^4/3 in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N logN convergence to FEM, with no loss of accuracy in the results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。