首页> 外文期刊>Archives of Computational Methods in Engineering >Taylor-Series Expansion Based Numerical Methods: A Primer, Performance Benchmarking and New Approaches for Problems with Non-smooth Solutions
【24h】

Taylor-Series Expansion Based Numerical Methods: A Primer, Performance Benchmarking and New Approaches for Problems with Non-smooth Solutions

机译:基于泰勒系列扩展的数值方法:底漆,性能基准和非平滑解决方案问题的新方法

获取原文
获取原文并翻译 | 示例

摘要

We provide a primer to numerical methods based on Taylor series expansions such as generalized finite difference methods and collocation methods. We provide a detailed benchmarking strategy for these methods as well as all data files including input files, boundary conditions, point distribution and solution fields, so as to facilitate future benchmarking of new methods. We review traditional methods and recent ones which appeared in the last decade. We aim to help newcomers to the field understand the main characteristics of these methods and to provide sufficient information to both simplify implementation and benchmarking of new methods. Some of the examples are chosen within a subset of problems where collocation is traditionally known to perform sub-par, namely when the solution sought is non-smooth, i.e. contains discontinuities, singularities or sharp gradients. For such problems and other simpler ones with smooth solutions, we study in depth the influence of the weight function, correction function, and the number of nodes in a given support. We also propose new stabilization approaches to improve the accuracy of the numerical methods. In particular, we experiment with the use of a Voronoi diagram for weight computation, collocation method stabilization approaches, and support node selection for problems with singular solutions. With an appropriate selection of the above-mentioned parameters, the resulting collocation methods are compared to the moving least-squares method (and variations thereof), the radial basis function finite difference method and the finite element method. Extensive tests involving two and three dimensional problems indicate that the methods perform well in terms of efficiency (accuracy versus computational time), even for non-smooth solutions.
机译:我们为基于泰勒串联扩展的数值方法提供了一种底漆,例如广义有限差分方法和搭配方法。我们为这些方法提供详细的基准测试策略以及包括输入文件,边界条件,点分发和解决方案字段的所有数据文件,以便于新方法的未来基准。我们审查了传统的方法和最近在过去十年中出现的方法。我们的目标是帮助新手了解这些方法的主要特征,并为简化新方法提供足够的信息,以简化实现和基准。选择一些示例在传统上已知搭配的问题的子集中选择,即当寻求的解决方案是非平滑的时,即包含不连续性,奇点或尖锐梯度。对于具有平滑解决方案的这些问题和其他更简单的问题,我们深入研究权重函数,校正功能和给定支持中节点数量的影响。我们还提出了新的稳定方法来提高数值方法的准确性。特别是,我们试验使用Voronoi图来进行重量计算,搭配方法稳定方法,并支持奇异解决方案问题的节点选择。 With an appropriate selection of the above-mentioned parameters, the resulting collocation methods are compared to the moving least-squares method (and variations thereof), the radial basis function finite difference method and the finite element method.涉及两个和三维问题的广泛测试表明该方法在效率(精度与计算时间)方面表现良好,即使是非平滑解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号