| 连分式算法插值顺序的有效安排 |
| |
| 引用本文： | 邱会中.连分式算法插值顺序的有效安排[J].电子科技大学学报(社会科学版),1989(3). |
| |
| 作者姓名： | 邱会中 |
| |
| 作者单位： | 电子科技大学应用数学系 |
| |
| 摘 要： | n节连分式算法是一个实用的一维搜索方法。构造连分式插位函数时,部分分母的计算在该算法中占有较大的比重,本文通过对插值点先后顺序的有效安排,使得部分分母的计算量下降近三分之一。最后,对该算法可能遇到的数值困难提供了一个实施方案。
|
| 关 键 词： | 一维搜索 连分式 插值顺序 部分分母 计算量 |
AN EFFECTIVE ARRANGEMENT TO THE INTERPOLATION SEQUENCE OF THE CONTINUED FRACTION ALGORITHM |
| |
| Qiu Hueizhong.AN EFFECTIVE ARRANGEMENT TO THE INTERPOLATION SEQUENCE OF THE CONTINUED FRACTION ALGORITHM[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1989(3). |
| |
| Authors: | Qiu Hueizhong |
| |
| Institution: | Dept.of Applied mathematics |
| |
| Abstract: | N-joint continued fraction algorithm is a practical method for one dimensional research. The main work in this method is to calculate the part-denominator, involved by the arrangement of the interpolation sequence. By the original procedure, all of the part-denominator must be calculated time by time.A new procedure to arrange the interpolation sequence is presented. With this procedure, some of the part-denominator can be obtained directly from the last iteration. Thus the amount of the part-denominator calculation can be put down at the rate about 1/3. |
| |
| Keywords: | one dimension research continued fraction interpolation sequence part-denominator calculation amount |
| 本文献已被 CNKI 等数据库收录！ |
