...
首页> 外文期刊>BIT numerical mathematics >Central orderings for the Newton interpolation formula
【24h】

Central orderings for the Newton interpolation formula

机译:牛顿插值公式的中央排序

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

摘要

The stability properties of the Newton interpolation formula depend on the order of the nodes and can be measured through a condition number. Increasing and Leja orderings have been previously considered (Carnicer et al. in J Approx Theory, 2017. https://doi.org/10.1016/j.jat.2017.07.005; Reichel in BIT 30:332-346, 1990). We analyze central orderings for equidistant nodes on a bounded real interval. A bound for conditioning is given. We demonstrate in particular that this ordering provides a more stable Newton formula than the natural increasing order. We also analyze of a central ordering with respect to the evaluation point, which provides low bounds for the conditioning. Numerical examples are included.
机译:牛顿插值公式的稳定性取决于节点的顺序,并且可以通过条件数来度量。以前已经考虑了递增和Leja排序(Carnicer等人在J Approx Theory,2017. https://doi.org/10.1016/j.jat.2017.07.005; Reichel in BIT 30:332-346,1990)。我们分析了有界实区间上等距节点的中心排序。给出了条件的界限。我们特别证明,与自然递增顺序相比,该顺序提供了更稳定的牛顿公式。我们还分析了相对于评估点的中央排序,这为条件提供了下界。包括数值示例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号