程序设计实习(II)：算法设计 18_方程求解.pptxVIP

程序设计实习第十八讲 方程求解;内容;枚举的应用:非线性方程求根;非线性方程根的数值解法;适用性：不要求方程f(x)=0在区间[a0, b0]上的解唯一，求得任意一个解即可;非线性方程求根: 牛顿迭代法;牛顿迭代法的几何证明;弦截法: 避免牛顿迭代法中的导数计算;弦截二分法: 单调区间内求非线性方程的根;非线性方程求根的实现(二分法和弦截二分法);double CNonLinearEqSolver::root(double lbound, double ubound) { double mVar, mVal; lVar = lbound; lVal = fun(lbound); if ( lVal=epsilon1 lVal=epsilon0 ) return lbound; rVar = ubound; rVal = fun(ubound); if ( rVal=epsilon1 rVal=epsilon0 ) return ubound; mVar = getMidVar(); mVal = fun(mVar); while ( mValepsilon0 || mValepsilon1 ) { if ( (mVal0 lVal0) || (mVal0 lVal0) ) { rVal = mVal; rVar = mVar; } else { lVal = mVal; lVar = mVar; } mVar = getMidVar(); mVal = fun(mVar); } return mVar; };CNonLinearEqSolver::CNonLinearEqSolver(double epsilon, double (*function)(double)) { epsilon0 = 0 - epsilon; epsilon1 = epsilon; fun = function; } double CNonLinearEqSolver::getMidVar() { return (lVar + rVar) / 2.0; } CChordSection::CChordSection(double epsilon, double (*function)(double)):CNonLinearEqSolver(epsilon, function) { } double CChordSection::getMidVar() { return lVar - lVal * (rVar - lVar) / (rVal - lVal); } ;double fun1(double x) { double temp; temp = x*x; return ( temp*x - temp + 7.0 ); } double fun2(double x) { return sin(x)-exp(x)+0.3; } int main() { CNonLinearEqSolver eq1(0.000001, fun1); CChordSection eq2(0.000001, fun1); CNonLinearEqSolver eq3(0.000001, fun2); couteq1.root(-5, -1)endl; couteq2.root(-5, 1)endl; couteq3.root(-5, -1)endl; return 0; };N阶线性方程组求解;AX=b的解结构判定;高斯列主元消元法求N阶线性方程组;AX=b ? UX=L-1b;高斯列主元消元法的适用性;高斯列主元消元法的计算效率;高斯列主元消元法的误差控制;搜索的应用: 迭代法求解n阶线性方程组;令: X*表示n阶线性方程组AX=b的解 X=BX+F是AX=b的等价表示 |?E-B|=0，求得的?值?1, ?2,..., ?n即为B的特征值;迭代法的适用性;Jacobi迭代法;gauss-seidel迭代法;迭代法的使用;高斯列主元消去法和Jacobi迭代法的参考实现代码(简化版);class CLinearEqSysSolver { double epsilon0, epsilon1; int row, column, method; vectordouble matrix, valVec, varVec; void gauss_eleminate(); void selectPivot(int curRow); void jacobi_iterate(); void gauss_seidel_iterate(); public: