Creator | Title | Description | Subject | Date | ||
---|---|---|---|---|---|---|
1 |
![]() | Sikorski, Kris | An interior ellipsoid algorithm for fixed points | We consider the problem of approximating fixed points of non-smooth contractive functions with using of the absolute error criterion. In [12] we proved that the upper bound on the number of function evaluations to compute ?-approximations is 0(n3(In 1/? + In 1/1-q +In n)) in the worst case, where ... | Ellipsoid algorithm; Contractive functions; Fixed points | 1998 |
2 |
![]() | Sikorski, Kris | Selected fixed point problems and algorithms | We present a new version of the almost optimal Circumscribed Ellipsoid Algorithm (CEA) for approximating fixed points of nonexpanding Lipschitz functions. We utilize the absolute and residual error criteria with respect to the second norm. The numerical results confirm that the CEA algorithm is m... | Fixed point problems; Optimal algorithms; Nonlinear equations; Ellipsoid algorithm; Computational complexity. | 2007 |