Nonlinear adaptive analysis via quasi-Newton approach

被引:1
|
作者
Ohtmer, O [1 ]
机构
[1] Calif State Univ Long Beach, Dept Mech Engn, Long Beach, CA 90840 USA
关键词
nonadaptive analysis approach; quasi-Newton approach; FORTRAN;
D O I
10.1016/S0965-9978(98)00119-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The quasi-Newton (QN) method has proven to be the most effective optimization method. The purpose of this article is to apply this numerical procedure for optimization problems as well as large deflection nonlinear analysis. A FORTRAN program developed to calculate constrained problems is used as the basic code within an iterative nonlinear adaptive analysis. The new numerical procedure calculates the displacements of an elastic structure arising from given loading conditions. Then the displacements are added to the joint coordinates. In the deformed position the degrees of freedom of the structure are supported and the negative displacements are applied as loadings, to move the structure back to the old undeformed position. The difference of the reaction forces in both positions specifies the geometric nonlinear adaptive loading conditions. These additional forces, together with the displacement increments, form the QN vectors being applied in an iteration procedure until convergence is achieved. The new numerical procedure reduces the number of decompositions of the updated inverse stiffness matrix (solving a linear system of equations) and therefore is much more efficient than the standard QN approach. Although the word adaptive is mainly used in the sense of an "adaptive control" of a Finite Element mesh size, in this article the word is used for the calculation of the unbalanced forces applying the negative displacement increments as 'load increments". (C) 1999 Elsevier Science Ltd and Civil-Comp Ltd. All rights reserved.
引用
收藏
页码:595 / 605
页数:11
相关论文
共 50 条
  • [31] Fast adaptive LDA using quasi-Newton algorithm
    Moghaddam, H. Abrishami
    Matinfar, M.
    PATTERN RECOGNITION LETTERS, 2007, 28 (05) : 613 - 621
  • [32] Improved Quasi-Newton Adaptive-Filtering Algorithm
    Ali, Md Zulfiquar
    Antoniou, Andreas
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2010, 57 (08) : 2109 - 2118
  • [33] Adaptive quasi-newton projection algorithm for sparse recovery
    Zhou X.
    Feng X.
    Jing M.
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2019, 46 (03): : 14 - 19
  • [34] Robust adaptive quasi-Newton algorithms for eigehsubspace estimation
    Ouyang, S
    Ching, PC
    Lee, T
    IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 2003, 150 (05): : 321 - 330
  • [35] Quasi-Newton algorithm for adaptive minor component extraction
    Ouyang, S
    Ching, PC
    Lee, T
    ELECTRONICS LETTERS, 2002, 38 (19) : 1142 - 1144
  • [36] Partitioned quasi-Newton methods for sparse nonlinear equations
    Cao, Hui-Ping
    Li, Dong-Hui
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 66 (03) : 481 - 505
  • [37] Practical Quasi-Newton algorithms for singular nonlinear systems
    Sandra Buhmiler
    Nataša Krejić
    Zorana Lužanin
    Numerical Algorithms, 2010, 55 : 481 - 502
  • [38] A QUASI-NEWTON METHOD FOR SOLVING NONLINEAR ALGEBRAIC EQUATIONS
    KIM, S
    TEWARSON, RP
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1992, 24 (04) : 93 - 97
  • [39] Fast robust quasi-Newton algorithm for adaptive arrays
    Klemes, M
    IEE PROCEEDINGS-COMMUNICATIONS, 1999, 146 (04): : 231 - 239
  • [40] Preconditioning Nonlinear Conjugate Gradient with Diagonalized Quasi-Newton
    Dener, Alp
    Denchfield, Adam
    Munson, Todd
    PROCEEDINGS OF THE PLATFORM FOR ADVANCED SCIENTIFIC COMPUTING CONFERENCE (PASC '19), 2019,