Takens-Bogdanov分歧点的分裂迭代算法  

A Splitting Iteration Method for Detecting Takens-Bogdanov Bifurcation Points

作　　者：叶瑞松[1] 

机构地区：[1]汕头大学数学研究所,汕头广东515063

出　　处：《应用数学》2001年第3期87-91,共5页Mathematica Applicata

摘　　要：本文构造分裂迭代算法用于计算 Takens-Bogdanov分歧点 ,该方法将减少计算的工作量和占用的内存 ,以可调节的速度线性收敛 ,并且可以求得 Takens-Bogdanov分歧点处 f0x 及 f0 *x 的广义零特征向量 .A splitting iteration method is proposed to compute Takens -B ogdnov bifurcation points. The method could reduce the computational work and st orage, and could converge linearly with an adjustable speed. Futhermore it could solve the generalized null eigenvectors of f x,f* x at the Takens-Bjog danov bifurcation point. Numerical computation shows that the proposed method is efficient.

关 键 词：Takens-Bogdanov分岐点 分裂迭代算法 扩张系统 线性收敛 非线性方程 发展方程 

分 类 号：O241.8[理学—计算数学] O177.91[理学—数学]