BFGS Algorithm: Difference between revisions

From OpenSeesWiki
Jump to navigation Jump to search
(Created page with '{{CommandManualMenu}} This command is used to construct a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm object. The BFGS method is one of the most effective matrix-upd...')
 
No edit summary
Line 27: Line 27:




MORE TO DO.


----
----


Code Developed by: <span style="color:blue"> fmk </span>
Code Developed by: <span style="color:blue"> fmk </span>

Revision as of 21:52, 8 March 2010




This command is used to construct a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm object. The BFGS method is one of the most effective matrix-update or quasi Newton methods for iteration on a nonlinear system of equations. The method computes new search directions at each iteration step based on the initial jacobian, and subsequent trial solutions. The unlike regular Newton-Raphson does not require the tangent matrix be reformulated and refactored at every iteration, however unlike ModifiedNewton it does not rely on the tangent matrix from a previous iteration.


algorithm BFGS



REFERNCES:

  1. Denis, J.E "A Brief Survey of Convergence Methods for Quasi_Newton Methods", SIAMS-AMS Proceedings, Vol (9), 185-200, 1976.
  2. K.J. Bathe and A.P.Cimento "Some Practical Procedures for the Solution of Nonlinear Finte Element Equations", Computer Methods in Applied Mechanics and Engineering, Vol(22) 59-85, 1980.

THEORY:

In the BFGS method the following is employed at each time step:

<math> \Gamma_{n+1} = R(U_{n+1}) - R(U_n),\!</math>
<math> \Delta U_{n+1} = U_{n+1} + \Delta U\,\!</math>


MORE TO DO.


Code Developed by: fmk