COMPLEXITY OF FIXED POINTS IN MULTIVARIATE CASE
高维不动点的复杂性

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.