%0 Journal Article
%T COMPLEXITY OF FIXED POINTS IN MULTIVARIATE CASE<br>高维不动点的复杂性
%A 孙方裕
%J 计算数学
%D 1992
%I 
%X In the paper, the complexity of computing an approximation to a fixed pointof a contractive function with contractive factor q(<1) in the multivariate case isstudied.An optimal multivariate fixed point envelope(MFPE) algorithm is developedand a recurrence relation of error estimate is obtained. Thus the open problem byK. Sikorski and H. Wozniakowski is solved.
%K 高维
%K 压缩函数
%K 不动点
%K 复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=8A0EF2F89A25798517BA52900408FEBA&yid=F53A2717BDB04D52&vid=F3583C8E78166B9E&iid=E158A972A605785F&sid=7D1E6EEC2019967D&eid=A33A8FD1432A4C3E&journal_id=0254-7791&journal_name=计算数学&referenced_num=0&reference_num=0