SecantLineSearch.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:43 $
00023 // $Source: /usr/local/cvs/OpenSees/SRC/analysis/algorithm/equiSolnAlgo/SecantLineSearch.h,v $
00024 
00025 // Written: fmk 
00026 // Created: 11/01
00027 
00028 // Description: This file contains the class definition for SecantLineSearch.
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(j) -  s(j) * (eta(j-1)-eta(j))
00033 //                                     ------------------------
00034 //                                           s(j-1) - s(j)
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 // What: "@(#)NewtonLineSearch.h, revA"
00041 
00042 #ifndef SecantLineSearch_h
00043 #define SecantLineSearch_h
00044 
00045 #include <LineSearch.h>
00046 class Vector;
00047 //class OPS_Stream; //Jeremic@ucdavis.edu taken out since there is an include<iOPS_Stream.h> in LineSearch.h 
00048 
00049 class SecantLineSearch: public LineSearch
00050 {
00051   public:
00052     SecantLineSearch(double tolerance = 0.8, 
00053                      int    maxIter   = 10, 
00054                      double minEta    = 0.1, 
00055                      double maxEta    = 10.0, 
00056                      int    printFlag = 1);
00057 
00058     ~SecantLineSearch();
00059 
00060     int newStep(LinearSOE &theSOE);
00061     int search(double s0, 
00062                double s1, 
00063                LinearSOE &theSOE, 
00064                IncrementalIntegrator &theIntegrator);
00065 
00066     int sendSelf(int commitTag, Channel &theChannel);
00067     int recvSelf(int commitTag, Channel &theChannel, FEM_ObjectBroker &theBroker);
00068     void Print(OPS_Stream &s, int flag =0) ;    
00069     
00070   protected:
00071     
00072   private:
00073     Vector *x;
00074     double tolerance;
00075     int    maxIter;
00076     double minEta;
00077     double maxEta;
00078     int    printFlag;
00079 };
00080 
00081 #endif
00082 
00083 

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