Gegenbauer投影的最优收敛速度与误差局部化
Optimal rates of convergence and error localization of Gegenbauer projections
AI总结:
该研究分析最大范数下Gegenbauer投影的最优收敛速度,明确其与最佳逼近收敛速度的对应关系及差异倍数,解释带奇点函数的误差局部化现象,为Gegenbauer逼近与谱方法提供新的理论认知。
摘要:
受对比Gegenbauer投影与最佳逼近收敛行为的启发,我们研究了最大范数下Gegenbauer投影的最优收敛速度。我们证明,当基础函数在椭圆上及椭圆内解析且λ≤0,或基础函数可微且λ≤1时(其中λ为Gegenbauer投影中的参数),Gegenbauer投影的收敛速度与最佳逼近的收敛速度相同。若基础函数解析且λ>0,或基础函数可微且λ>1,则Gegenbauer投影的收敛速度比最佳逼近分别慢n^λ倍和n^{λ-1}倍。一个例外情况是带端点奇点的函数:对于所有λ>-1/2,Gegenbauer投影与最佳逼近的收敛速度相同。针对带内部或端点奇点的函数,我们从理论上解释了Gegenbauer投影的误差局部化现象,以及为何除了在临界点的小邻域内之外,Gegenbauer投影的精度优于最佳逼近。我们的分析为Gegenbauer逼近及相关谱方法的效力提供了根本性的新见解。
英文摘要:
Motivated by comparing the convergence behavior of Gegenbauer projections and best approximations, we study the optimal rate of convergence for Gegenbauer projections in the maximum norm. We show that the rate of convergence of Gegenbauer projections is the same as that of best approximations under conditions of the underlying function is either analytic on and within an ellipse and $λ\leq0$ or differentiable and $λ\leq1$, where $λ$ is the parameter in Gegenbauer projections. If the underlying function is analytic and $λ>0$ or differentiable and $λ>1$, then the rate of convergence of Gegenbauer projections is slower than that of best approximations by factors of $n^λ$ and $n^{λ-1}$, respectively. An exceptional case is functions with endpoint singularities, for which Gegenbauer projections and best approximations converge at the same rate for all $λ>-1/2$. For functions with interior or endpoint singularities, we provide a theoretical explanation for the error localization phenomenon of Gegenbauer projections and for why the accuracy of Gegenbauer projections is better than that of best approximations except in small neighborhoods of the critical points. Our analysis provides fundamentally new insight into the power of Gegenbauer approximations and related spectral methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。