期刊文献+

Optimizing Time-Spectral Solution of Initial-Value Problems

Optimizing Time-Spectral Solution of Initial-Value Problems
下载PDF
导出
摘要 Time-spectral solution of ordinary and partial differential equations is often regarded as an inefficient approach. The associated extension of the time domain, as compared to finite difference methods, is believed to result in uncomfortably many numerical operations and high memory requirements. It is shown in this work that performance is substantially enhanced by the introduction of algorithms for temporal and spatial subdomains in combination with sparse matrix methods. The accuracy and efficiency of the recently developed time spectral, generalized weighted residual method (GWRM) are compared to that of the explicit Lax-Wendroff and implicit Crank-Nicolson methods. Three initial-value PDEs are employed as model problems;the 1D Burger equation, a forced 1D wave equation and a coupled system of 14 linearized ideal magnetohydrodynamic (MHD) equations. It is found that the GWRM is more efficient than the time-stepping methods at high accuracies. The advantageous scalings Nt<sup style="margin-left:-6px;">1.0Ns<sup style="margin-left:-6px;">1.43 and Nt<sup style="margin-left:-6px;">0.0Ns<sup style="margin-left:-6px;">1.08 were obtained for CPU time and memory requirements, respectively, with Nt and Ns denoting the number of temporal and spatial subdomains. For time-averaged solution of the two-time-scales forced wave equation, GWRM performance exceeds that of the finite difference methods by an order of magnitude both in terms of CPU time and memory requirement. Favorable subdomain scaling is demonstrated for the MHD equations, indicating a potential for efficient solution of advanced initial-value problems in, for example, fluid mechanics and MHD. Time-spectral solution of ordinary and partial differential equations is often regarded as an inefficient approach. The associated extension of the time domain, as compared to finite difference methods, is believed to result in uncomfortably many numerical operations and high memory requirements. It is shown in this work that performance is substantially enhanced by the introduction of algorithms for temporal and spatial subdomains in combination with sparse matrix methods. The accuracy and efficiency of the recently developed time spectral, generalized weighted residual method (GWRM) are compared to that of the explicit Lax-Wendroff and implicit Crank-Nicolson methods. Three initial-value PDEs are employed as model problems;the 1D Burger equation, a forced 1D wave equation and a coupled system of 14 linearized ideal magnetohydrodynamic (MHD) equations. It is found that the GWRM is more efficient than the time-stepping methods at high accuracies. The advantageous scalings Nt<sup style="margin-left:-6px;">1.0Ns<sup style="margin-left:-6px;">1.43 and Nt<sup style="margin-left:-6px;">0.0Ns<sup style="margin-left:-6px;">1.08 were obtained for CPU time and memory requirements, respectively, with Nt and Ns denoting the number of temporal and spatial subdomains. For time-averaged solution of the two-time-scales forced wave equation, GWRM performance exceeds that of the finite difference methods by an order of magnitude both in terms of CPU time and memory requirement. Favorable subdomain scaling is demonstrated for the MHD equations, indicating a potential for efficient solution of advanced initial-value problems in, for example, fluid mechanics and MHD.
出处 《American Journal of Computational Mathematics》 2018年第1期7-26,共20页 美国计算数学期刊(英文)
关键词 Time-Spectral SPECTRAL Method GWRM CHEBYSHEV POLYNOMIAL Initial-Value Fluid MECHANICS MHD Time-Spectral Spectral Method GWRM Chebyshev Polynomial Initial-Value Fluid Mechanics MHD
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部