RegulaFalsiLineSearch.hGo to the documentation of this file.00001 /* ****************************************************************** ** 00002 ** OpenSees - Open System for Earthquake Engineering Simulation ** 00003 ** Pacific Earthquake Engineering Research Center ** 00004 ** ** 00005 ** ** 00006 ** (C) Copyright 1999, The Regents of the University of California ** 00007 ** All Rights Reserved. ** 00008 ** ** 00009 ** Commercial use of this program without express permission of the ** 00010 ** University of California, Berkeley, is strictly prohibited. See ** 00011 ** file 'COPYRIGHT' in main directory for information on usage and ** 00012 ** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. ** 00013 ** ** 00014 ** Developed by: ** 00015 ** Frank McKenna (fmckenna@ce.berkeley.edu) ** 00016 ** Gregory L. Fenves (fenves@ce.berkeley.edu) ** 00017 ** Filip C. Filippou (filippou@ce.berkeley.edu) ** 00018 ** ** 00019 ** ****************************************************************** */ 00020 00021 // $Revision: 1.3 $ 00022 // $Date: 2003/02/14 23:00:43 $ 00023 // $Source: /usr/local/cvs/OpenSees/SRC/analysis/algorithm/equiSolnAlgo/RegulaFalsiLineSearch.h,v $ 00024 00025 // Written: fmk 00026 // Created: 11/01 00027 00028 // Description: This file contains the class definition for RegulaFalsiLineSearch. 00029 // This performs the search for U(i+1) = U(i) + eta * deltaU(i) by using the 00030 // secant method to find the best solution. 00031 // 00032 // eta(j+1) = eta(u) - s(u) * (eta(l) -eta(u)) 00033 // ------------------------ 00034 // s(l) - s(u) 00035 // 00036 // where s(j) = U(i+1,j) ^ R(U(i+1, j)) 00037 // 00038 // and U(i+1,j) = U(i) + eta(j)*deltaU(i) 00039 // 00040 // note that as we want eta(u) and eta(l) to bracket the solution, 00041 // i.e. s(u)*s(l)<0, if at all possible - the lower and upper bounds 00042 // change depending on sign. 00043 // 00044 // if s(eta(j+1))*s(l) < 0 { eta(u) = eta(j+1) and s(u) = s(eta(j+1)) 00045 // if s(eta(j+1))*s(u) < 0 { eta(l) = eta(j+1) and s(l) = s(eta(j+1)) 00046 // if s(eta(j+1))*s(u) == 0 SOLN FOUND. 00047 00048 #ifndef RegulaFalsiLineSearch_h 00049 #define RegulaFalsiLineSearch_h 00050 00051 #include <LineSearch.h> 00052 class Vector; 00053 //class OPS_Stream; //Jeremic@ucdavis.edu taken out since there is an include<iOPS_Stream.h> in LineSearch.h 00054 00055 class RegulaFalsiLineSearch: public LineSearch 00056 { 00057 public: 00058 RegulaFalsiLineSearch(double tolerance = 0.8, 00059 int maxIter = 10, 00060 double minEta = 0.1, 00061 double maxEta = 10.0, 00062 int printFlag = 1); 00063 00064 ~RegulaFalsiLineSearch(); 00065 00066 int newStep(LinearSOE &theSOE); 00067 int search(double s0, 00068 double s1, 00069 LinearSOE &theSOE, 00070 IncrementalIntegrator &theIntegrator); 00071 00072 int sendSelf(int commitTag, Channel &theChannel); 00073 int recvSelf(int commitTag, Channel &theChannel, FEM_ObjectBroker &theBroker); 00074 void Print(OPS_Stream &s, int flag =0) ; 00075 00076 protected: 00077 00078 private: 00079 Vector *x; 00080 double tolerance; 00081 int maxIter; 00082 double minEta; 00083 double maxEta; 00084 int printFlag; 00085 }; 00086 00087 #endif 00088 00089
Generated on Mon Oct 23 15:04:57 2006 for OpenSees by |
opensees-support @ berkeley.edu
Supported by the National Science Foundation
©2006, UC Regents