On global performance of approximations to smooth curves using gridded data
规则网格数据下光滑曲线近似的全局表现AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要涉及网格数据的边界曲线估计,未出现经济结构估计或所列其他领域的明确依据。
规则网格数据下光滑曲线近似的全局表现AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Approximating boundaries using data recorded on a regular grid induces discrete rounding errors in both vertical and horizontal directions. In cases where grid points exhibit at least some degree of randomness, an extensive theory has been developed for local-polynomial boundary estimators. It is inapplicable to regular grids, however. In this paper we impose strict regularity of the grid and describe the performance of local linear estimators in this context. Unlike the case of classical curve estimation problems, pointwise convergence rates vary erratically along the boundary, depending on number-theoretic properties of the boundary’s slope. However, average convergence rates, expressed in the $L_1$ metric, are much less susceptible to fluctuation. We derive theoretical bounds to performance, coming within no more than a logarithmic factor of the optimal convergence rate.