%0 Journal Article
%T A NEW CONTINUED FRACTION ALGORITHM AND ITS CONVERGENCE<br>一个新的连分式算法及其收敛性
%A 陈开周
%A 王孔明
%J 计算数学
%D 1988
%I 
%X This paper proposes a new linear search method: the continued fraction algorithm. It re-quires computing only three functional values at each iteration, and using one division in com-puting every coefficient of the continued fraction interpolation. Its numerical stability is good,and its convergence rate is fast. The order of convergence is approximately 1.8393. Thus, thisalgorithm is a very attractive method for the local one-dimensional optimization. If we usethis method for the imprecise linear search, it is necessary only to compute three functional va-lues. It can also be applied to solve the transcendental equation.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=0B4DFD995B50D2A1A3A79355754EB082&yid=0702FE8EC3581E51&vid=F3090AE9B60B7ED1&iid=CA4FD0336C81A37A&sid=6209D9E8050195F5&eid=BE33CC7147FEFCA4&journal_id=0254-7791&journal_name=计算数学&referenced_num=3&reference_num=0