FASTER MODIFIED NEWTON-RAPHSON ITERATION

被引:115
作者
CRISFIELD, MA
机构
[1] Research Laboratory, Department of the Environment, Crowthorne, Berks RG11 6AU, Transport and Road
关键词
D O I
10.1016/0045-7825(79)90002-1
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The paper describes an accelerated modified Newton-Raphson iteration in which the iterative deflection change is a scalar times the previous iterative change plus a further scalar times the usual unaccelerated change. These scalars are automatically recalculated at each iteration. They are related to inner products involving the iterative deflections and the present and past out-of-balance force vectors. The extra computation for each iteration is negligble, the only penalty being the storage of two extra vectors. The method is based on a secant approach and leads to a significant reduction in the required number of iterations. Examples are presented in which the method is applied to the nonlinear analysis of thin plates and shells. The technique is used in conjunction with the finite element method. © 1979.
引用
收藏
页码:267 / 278
页数:12
相关论文
共 27 条
  • [1] Zienkiewicz, The finite element method, (1977)
  • [2] Nayak, Zienkiewicz, Note on the “alpha”-constant stiffness method for the analysis of non-linear problems, International Journal for Numerical Methods in Engineering, 4, pp. 579-582, (1972)
  • [3] Jennings, Accelerating the convergence of matrix iterative processes, J. Inst. Math. Appls., 8, pp. 99-110, (1971)
  • [4] Basu, Letter to the editor, Int. J. Numer. Meths. Eng., (1974)
  • [5] Aitken, On the iterative solution of a system of linear equations, Proc. Roy. Soc. Edinburgh, 63, pp. 52-60, (1950)
  • [6] Davidon, Variable metric method for minimisation, Argonne Nat. Lab. Report ANL-5990 Rev., (1959)
  • [7] Fletcher, Powell, A rapidly convergent descent method for minimisation, The Computer Journal, 6, pp. 163-168, (1963)
  • [8] Fletcher, A new approach to variable metric algorithms, The Computer Journal, 13, pp. 317-322, (1970)
  • [9] Broyden, The convergence of a class of double-rank minimisation 2: the new algorithm, J. Inst. Math. Appls., 6, pp. 222-231, (1970)
  • [10] Oren, Self-scaling variable metric algorithms without line search for unconstrained minimisation, Mathematics of Computation, 17, pp. 873-885, (1973)