摘要
Consider the problem of computing zeroes of a continuous, mapping f: R^n→R^n. As a model of subsequent complexity discussions, this paper proposes a made-easy simplicial algorithm for one zero of the mapping, and presents results on feasibility arid on conver gence.
基金
Project supported in part by the Foundation of the Advanced Research Centre, Zhongshan University
