PN结泊松方程的一种改进算法及其Matlab验证

来源期刊:中南大学学报(自然科学版)2008年第5期

论文作者:邓宏贵 郭俊 刘利强 周克省

文章页码:913 - 913

关键词:泊松方程;Newton迭代法;逐次超松弛迭代法

Key words:Poisson equation; Newton iterative method; successive over-relaxation method

摘    要:针对在PN结泊松方程求解过程中几种常用方法存在的不足,提出一种改进算法。该算法结合求解非线性方程组的Newton迭代法与SOR(逐次超松弛迭代)法,即用松弛因子对Newton迭代过程的前、后2项进行加权平均,组成新的迭代公式。为进一步完善算法,在迭代公式中修改松弛因子,采用最佳松弛因子形式。根据改进算法的计算思路,运用Matlab7.0编程,对算法进行仿真与模拟。结果表明:算法真实可行,既保持计算的高精度,也明显地减少计算的迭代次数,提高求解过程的收敛速度,且仿真图像与文献图像较吻合。

Abstract: There exist some disadvantages in several common methods for solving the Poisson equation of PN junction, and so a new ameliorative arithmetic was presented. It combined Newton iterative method for solving nonlinear equations and SOR (Successive over-relaxation) method, which means weighted average between the two closed items in Newton iterative method. Finally the relaxation factor was revised to the best relaxation factor so as to improve the arithmetic better. According to the thinking of computing, the ameliorative arithmetic was simulated and modeled by Matlab 7.0 to validate its feasibility. The results show that this arithmetic is authentic and feasible. It keeps the high precision, advances the convergence speed markedly and decreases the iteration times of computing significantly as well. What’s more, the image of simulation is consistent with that of literature well.

相关论文

  • 暂无!

相关知识点

  • 暂无!

有色金属在线官网  |   会议  |   在线投稿  |   购买纸书  |   科技图书馆

中南大学出版社 技术支持 版权声明   电话:0731-88830515 88830516   传真:0731-88710482   Email:administrator@cnnmol.com

互联网出版许可证:(署)网出证(京)字第342号   京ICP备17050991号-6      京公网安备11010802042557号