摘要
A 2-step nonlinear conjugate gradient (NCG) method has been introduced and an-alyzed in [2]. This method can be used to solve large sparse nonlinear equations with nonsymmetric Jacobin. In this paper, we presented a parallel algorithm of precohdi-tioned 2-step nonlinear conjugate gradient method and discuss how to choose the better precondition which is more suitable for shared memory multiprocessor. Also, we ana lyze how to implement efficiently polynomial preconditioning with step NCG method on shared memory parallel computer. Numerical result on solving nonlinear equations arising from the discretization of nonlinear elliptic partial equations have been given.
A 2-step nonlinear conjugate gradient (NCG) method has been introduced and an-alyzed in [2]. This method can be used to solve large sparse nonlinear equations with nonsymmetric Jacobin. In this paper, we presented a parallel algorithm of precohdi-tioned 2-step nonlinear conjugate gradient method and discuss how to choose the better precondition which is more suitable for shared memory multiprocessor. Also, we ana lyze how to implement efficiently polynomial preconditioning with step NCG method on shared memory parallel computer. Numerical result on solving nonlinear equations arising from the discretization of nonlinear elliptic partial equations have been given.
出处
《数值计算与计算机应用》
CSCD
北大核心
1997年第2期151-160,共10页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金
