论文部分内容阅读
Beginning with the method of whole path iterative ray-tracing and according to the positive definiteness of the coefficient matrix of the systems of linear equations,a symmetry block tridiagonai matrix was decomposed into the product of block bidiagonal triangular matrix and its transpose by means of Cholesky decomposition.Then an algorithm for solving systems of block bidiagonal triangular linear equations was given,which is not necessary to treat with the zero elements out of banded systems.A fast algorithm for solving the systems of symmetry block tridiagonal linear equations was deduced,which can quicken the speed of ray-tracing.Finally,the simulation based on this algorithm for ray-tracing in three dimensional media was carried out.Meanwhile,the segmentally-iterative ray-tracing method and banded method for solving the systems of block tridiagonal linear equations were compared in the same model mentioned above.The convergence condition was assumed that the L-2 norm summation for mk,1 and mk,2 in the whole ray path was limited in 10-6.And the calculating speeds of these methods were compared.The results show that the calculating speed of this algorithm is faster than that of conventional method and the calculated results are accurate enough.In addition,its precision can be controlled according to the requirement of ray-tracing.