中文说明：不动点算法 2.2 To find a solution to p = g(p) given an initial approximation p0 INPUT: initial approximation p0; tolerance TOL; maximum number of iterations NO. 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报
English Description：
FIXED-POINT ALGORITHM 2.2 To find a solution to p = g(p) given an initial approximation p0 INPUT: initial approximation p0; tolerance TOL; maximum number of iterations NO. OUTPUT: approximate solution p or a message that the method fails.