| 有理平均逼近的新算法 |
| |
| 引用本文： | 胡宏伶. 有理平均逼近的新算法[J]. 数学理论与应用, 2007, 27(2): 112-114 |
| |
| 作者姓名： | 胡宏伶 |
| |
| 作者单位： | 湖南师范大学数学与计算机学院 长沙410081 |
| |
| 摘 要： | 有理平均逼近应比多项式逼近好,但至今研究很少.本文分析了此问题有奇性,并提出一种新算法:延拓 正则化,则以获得非常好的结果.数值实验也证实了此结论.
|
| 关 键 词： | 有理多项式 平均逼近 正则化 延拓法 |
| 修稿时间： | 2007-01-26 |
A NEW ALGORITHM FOR RATIONAL AVERAGE APPROXIMATION |
| |
| Hu Hongling. A NEW ALGORITHM FOR RATIONAL AVERAGE APPROXIMATION[J]. Mathematical Theory and Applications, 2007, 27(2): 112-114 |
| |
| Authors: | Hu Hongling |
| |
| Affiliation: | College of Mathematics and Conputer, Hunan Normal University, Changsha, 410081 |
| |
| Abstract: | Rational average approximation should be beter than polynomial approximation,but its study is few up to now.We have analyzed the singularity in the approximation and further proposed a new algorithm: regularization extension,by which better results can be obtained.The conclusion is verified by our numerical experiments. |
| |
| Keywords: | Rational Polynomial Average Approximation Regularization Extension Method |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
