Defeating 2-D Runge Problem by Coefficients and Order Determination (CAOD) Method
PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019)(2019)
摘要
Runge problem is a problem of edge-oscillations in polynomial interpolation of Runge function at evenly spaced nodes. While many works have been presented to defeat the 1-dimensional (1-D) Runge problem, its higher dimensional cases are rarely discussed. Our previous works have presented an approximation method called CAOD method to defeat the 1-D Runge problem. In this paper, we generalize this method to defeat the 2- (or higher-) dimensional Runge problem, and conduct computer experiments to substantiate the accuracy of the method.
更多查看译文
关键词
Runge problem, Interpolation, Coefficients and order determination (CAOD), Higher dimensions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要