OpenSees » SRC » analysis » algorithm » equiSolnAlgo

BisectionLineSearch.h

Go 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:42 $
00023 // $Source: /usr/local/cvs/OpenSees/SRC/analysis/algorithm/equiSolnAlgo/BisectionLineSearch.h,v $
00024 
00025 // Written: fmk 
00026 // Created: 11/01
00027 
00028 // Description: This file contains the class definition for BisectinLineSearch.
00029 // This performs the search for U(i+1) = U(i) + eta * deltaU(i) by using the 
00030 // bisection method to find the best solution.
00031 //
00032 //                eta(j+1) = eta(l) + eta(u)
00033 //                           ---------------
00034 //                                2.0
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 eta(u) and eta(l) must bracket the solution, i.e. s(u)*s(l)<0,
00041 //
00042 //      if s(eta(j+1))*s(l) < 0 { eta(u) = eta(j+1) and s(u) = s(eta(j+1))
00043 //      if s(eta(j+1))*s(u) < 0 { eta(l) = eta(j+1) and s(l) = s(eta(j+1))
00044 //      if s(eta(j+1))*s(u) == 0  SOLN FOUND.
00045 
00046 #ifndef BisectionLineSearch_h
00047 #define BisectionLineSearch_h
00048 
00049 #include <LineSearch.h>
00050 class Vector;
00051 //class OPS_Stream; //Jeremic@ucdavis.edu taken out since there is an include<iOPS_Stream.h> in LineSearch.h
00052 
00053 class BisectionLineSearch: public LineSearch
00054 {
00055   public:
00056     BisectionLineSearch(double tolerance = 0.8, 
00057                         int maxIter = 10, 
00058                         double minEta = 0.1, 
00059                         double maxEta = 10.0, 
00060                         int flag = 1);
00061 
00062     ~BisectionLineSearch();
00063 
00064     int newStep(LinearSOE &theSOE);
00065     int search(double s0, 
00066                double s1, 
00067                LinearSOE &theSOE, 
00068                IncrementalIntegrator &theIntegrator);
00069 
00070     int sendSelf(int commitTag, Channel &theChannel);
00071     int recvSelf(int commitTag, Channel &theChannel, FEM_ObjectBroker &theBroker);
00072     void Print(OPS_Stream &s, int flag =0) ;    
00073     
00074   protected:
00075     
00076   private:
00077     Vector *x;
00078     double tolerance;
00079     int    maxIter;
00080     double minEta;
00081     double maxEta;
00082     int    printFlag;
00083 };
00084 
00085 #endif
00086 
00087

Generated on Mon Oct 23 15:04:57 2006 for OpenSees by doxygen 1.5.0