检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:顾乐民[1]
机构地区:[1]同济大学,上海201804
出 处:《计算机工程与应用》2012年第7期34-38,共5页Computer Engineering and Applications
摘 要:预测型切比雪夫多项式,是切比雪夫多项式及最佳逼近理论在预测中的一个推广应用,可以解决一般预测中预测的可知、可控性问题。文中通过讨论后指出,在预测中,当预测误差不超过已知最大绝对误差时,预测将成为可知;当预测区间不超过已知最大范围时,预测将成为可控。基于这个原理,建立了一种具有预测功能的预测型切比雪夫多项式,Gn(x)多项式。论证了该多项式依据的微分方程、相关定义、有关性质、数学表式;阐述了该多项式的存在性;给出了Gn(x)多项式在y(x)10条件下构成的预测型最佳逼近g(x)多项式;提供了g(x)多项式得以实现的具体算法;介绍了一种使预测结果更接近实际值的误差补偿法;并给出了若干应用实例。Predictive type of Chebyshev polynomials are an extension of the Chebyshev polynomials and the best approximation theory, it can solve the general forecast predicted the knowability and controllability problems. Through discussions in the article pointed out, when the prediction error of not more than the known maximum absolute error, predicts will become known; when the prediction interval of not more than the known maximum range, the prediction will be controlled. Based on this principle, the prediction function predictive Chebyshev polynomials, Gn(x) polynomials are established. The polynomials based on differential equations, definitions, properties, mathematical tables, the existence of polynomial problems are demonstrated. The predictive type of the best approximation of g(x) polynomials, at y(x)1 0 conditions by Gn(x) polynomials posed, are provided. A specific algorithm to achieve the g(x) polynomials is presented. A way to make predictions closer to the actual value of the error compensation method is introduced, and some examples are given.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.203