首页> 外文会议>International workshop on computer algebra in scientific computing >Sharpness in Trajectory Estimation for Planar Four-points Piecewise-Quadratic Interpolation
【24h】

Sharpness in Trajectory Estimation for Planar Four-points Piecewise-Quadratic Interpolation

机译:平面四点分段二次插值轨迹估计的清晰度

获取原文

摘要

This paper discusses the problem of fitting non-parametric planar data Q_m = {q_i}_(i=0)~m with four-points piecewise-quadratic inter-polant to estimate an unknown convex curve γ in Euclidean space E~2 sampled more-or-less uniformly. The derivation of the interpolant involves non-trivial algebraic and symbolic computations. As it turns out, exclusive symbolic computations with Wolfram Mathematica 9 are unable to explicitly construct the interpolant in question. The alternative solution involves human and computer interaction. The theoretical asymptotic analysis concerning this interpolation scheme as already demonstrated yields quartic orders of convergence for trajectory estimation. This paper verifies in affirmative the sharpness of the above asymptotics via numerical tests and independently via analytic proof based on symbolic computations. Finally, we prove the necessity of admitting more-or-less uniformity and strict convexity to attain at least quartic order of convergence for trajectory approximation. In case of violating strict convexity of γ we propose a corrected interpolant Q which preserves quartic order of convergence.
机译:本文讨论了用四点分段二次插值拟合非参数平面数据Q_m = {q_i} _(i = 0)〜m来估计欧氏空间E〜2中未知凸曲线γ的问题。 -或更少统一。插值的推导涉及非平凡的代数和符号计算。事实证明,Wolfram Mathematica 9的排他符号计算无法显式构造所讨论的插值。替代解决方案涉及人机交互。已经证明的关于该插值方案的理论渐近分析可得出轨迹估计的四次收敛阶数。本文通过数值测试并通过基于符号计算的解析证明独立地验证了上述渐近性的清晰度。最后,我们证明了为轨迹逼近,必须接受或多或少的均匀性和严格的凸性,以至少达到四次收敛阶。在违反γ的严格凸性的情况下,我们提出了一个校正的插值Q,它保留了收敛的四次顺序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号