迭代法求两点边值问题课程设计.docVIP

基于java实现电子时钟 PAGE  PAGE 3 迭代法求两点边值问题（一） 摘要 当今的环境下，数值计算越来越依赖于计算机。大规模科学计算和工程技术中许多问题的解决，最终归结为大型稀疏线性方程组的求解，其求解时间在整个问题求解时间中占有很大的比重，有的甚至达到80%。由于现今科学研究和大型项目中各种复杂的可以对计算精度和计算速度的要求越来越高。因此，作为大规模科学计算基础的线性代数方程组的高效数值求解引起了人们的普遍关注。这种方程组的求解一般采用迭代法。这次我做的迭代法求两点边值问题就是通过MATLAB来实现的。 关于迭代法，是有很多种解决公式的：Jacobi，G-S和超松弛迭代法。这三种方法的原理大致相同，jacobi需要给定初向量，G-S则需要给定初值，超松弛法是对Guass-Seidel迭代法的加权平均改造。而本文则是对大型稀疏线性方程组迭代求解与三种迭代法（Jacobi，Gauss-Seidel和超松弛迭代法）的收敛速度与精确解的误差比较做出研究。 关键词：数值计算 迭代法 三种公式 ITERATION METHOD FOR TWO-POINT BOUNDARY VALUE PROBLEMS ABSTRACT Todays environment, numerical computation is more and more dependent on the computer. Many problems in the large-scale scientific computing and engineering solution, ultimately comes down to solving large sparse system of linear equations, the solution time occupies a large proportion in the whole problem solving time, some even reached 80%. Due to the current scientific research and large projects in various complex can claim to the computing precision and computing speed is higher and higher. Therefore, the linear algebraic equations, which is the basis for large-scale scientific computing efficient numerical solution has attracted widespread attention. To solve the general iterative method is used to this kind of equations. This time I do the iteration method of two-point boundary value problem is accomplished by MATLAB. About the iteration method, there are many kinds of solution formula is: Jacobi, G - S and over relaxation iteration method. The principles of these three methods are roughly the same, Jacobi need at the beginning of a given vector, G - S requires the given initial value, a super relaxation method is weighted average of the transformation of Gauss’ - Seidel iterative method. And this article is for iteration solving large sparse linear equations with three kinds of iterative method (Jacobi, Gauss - Seidel and over relaxation iteration method) the error between the converge