Computational complexity of fixed points
Computational complexity of fixed points
复制标题
定点的计算复杂度
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
K. Sikorski
中科院分区：
文献类型：
--
作者：
K. Sikorski
摘要。提出了近似Lipschitz函数的固定点的计算复杂性结果。第二个和无限规范案例以及绝对，残留和相对误差标准总结了单变量和多元结果。考虑到合同，非专业，方向性非义务和广泛的功能类别，并且表现出最佳或几乎最佳的算法。总结了一些数值实验。列出了致力于固定点问题的复杂性方面的文献。
Abstract.A review of computational complexity results for approximating fixed points of Lipschitz functions is presented. Univariate and multivariate results are summarized for the second and infinity norm cases as well as the absolute, residual and relative error criteria. Contractive, nonexpansive, directionally nonexpansive, and expansive classes of functions are considered and optimal or nearly optimal algorithms exhibited. Some numerical experiments are summarized. A literature devoted to the complexity aspects of fixed point problems is listed.