PEER NEES NEESit

• HOME
• USER
• DEVELOPER
• PROJECTS
• SUPPORT
• SITE MAP

• Dev Doc
• API
• Source
• Download
• Builds
• Bug Reports
• Message Board

NewtonLineSearch.cpp Go to the documentation of this file. /* ****************************************************************** ** ** OpenSees - Open System for Earthquake Engineering Simulation ** ** Pacific Earthquake Engineering Research Center ** ** ** ** ** ** (C) Copyright 1999, The Regents of the University of California ** ** All Rights Reserved. ** ** ** ** Commercial use of this program without express permission of the ** ** University of California, Berkeley, is strictly prohibited. See ** ** file 'COPYRIGHT' in main directory for information on usage and ** ** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. ** ** ** ** Developed by: ** ** Frank McKenna (fmckenna@ce.berkeley.edu) ** ** Gregory L. Fenves (fenves@ce.berkeley.edu) ** ** Filip C. Filippou (filippou@ce.berkeley.edu) ** ** ** ** ****************************************************************** */ // $Revision: 1.5 $ // $Date: 2005/11/29 22:42:42 $ // $Source: /usr/local/cvs/OpenSees/SRC/analysis/algorithm/equiSolnAlgo/NewtonLineSearch.cpp,v $ // Written: fmk // Created: 11/96 // Modified: Ed "C++" Love 10/00 to perform the line search // // Description: This file contains the implementation for NewtonLineSearch. // // What: "@(#)NewtonLineSearch.h, revA" #include <NewtonLineSearch.h> #include <AnalysisModel.h> #include <StaticAnalysis.h> #include <IncrementalIntegrator.h> #include <LinearSOE.h> #include <Channel.h> #include <FEM_ObjectBroker.h> #include <ConvergenceTest.h> #include <ID.h> //Null Constructor NewtonLineSearch::NewtonLineSearch( ) :EquiSolnAlgo(EquiALGORITHM_TAGS_NewtonLineSearch), theTest(0), theLineSearch(0) { } //Constructor NewtonLineSearch::NewtonLineSearch( ConvergenceTest &theT, LineSearch *theSearch) :EquiSolnAlgo(EquiALGORITHM_TAGS_NewtonLineSearch), theTest(&theT), theLineSearch(theSearch) { } // Destructor NewtonLineSearch::~NewtonLineSearch() { } int NewtonLineSearch::setConvergenceTest(ConvergenceTest *newTest) { theTest = newTest; return 0; } int NewtonLineSearch::solveCurrentStep(void) { // set up some pointers and check they are valid // NOTE this could be taken away if we set Ptrs as protecetd in superclass AnalysisModel *theAnaModel = this->getAnalysisModelPtr(); IncrementalIntegrator *theIntegrator = this->getIncrementalIntegratorPtr(); LinearSOE *theSOE = this->getLinearSOEptr(); if ((theAnaModel == 0) || (theIntegrator == 0) || (theSOE == 0) || (theTest == 0)){ opserr << "WARNING NewtonLineSearch::solveCurrentStep() - setLinks() has"; opserr << " not been called - or no ConvergenceTest has been set\n"; return -5; } theLineSearch->newStep(*theSOE); // set itself as the ConvergenceTest objects EquiSolnAlgo theTest->setEquiSolnAlgo(*this); if (theTest->start() < 0) { opserr << "NewtonLineSearch::solveCurrentStep() -"; opserr << "the ConvergenceTest object failed in start()\n"; return -3; } if (theIntegrator->formUnbalance() < 0) { opserr << "WARNING NewtonLineSearch::solveCurrentStep() -"; opserr << "the Integrator failed in formUnbalance()\n"; return -2; } int result = -1; do { //residual at this iteration before next solve const Vector &Resid0 = theSOE->getB() ; //form the tangent if (theIntegrator->formTangent() < 0){ opserr << "WARNING NewtonLineSearch::solveCurrentStep() -"; opserr << "the Integrator failed in formTangent()\n"; return -1; } //solve if (theSOE->solve() < 0) { opserr << "WARNING NewtonLineSearch::solveCurrentStep() -"; opserr << "the LinearSysOfEqn failed in solve()\n"; return -3; } //line search direction const Vector &dx0 = theSOE->getX() ; //intial value of s double s0 = - (dx0 ^ Resid0) ; if (theIntegrator->update(theSOE->getX()) < 0) { opserr << "WARNING NewtonLineSearch::solveCurrentStep() -"; opserr << "the Integrator failed in update()\n"; return -4; } if (theIntegrator->formUnbalance() < 0) { opserr << "WARNING NewtonLineSearch::solveCurrentStep() -"; opserr << "the Integrator failed in formUnbalance()\n"; return -2; } //new residual const Vector &Resid = theSOE->getB() ; //new value of s double s = - ( dx0 ^ Resid ) ; if (theLineSearch != 0) theLineSearch->search(s0, s, *theSOE, *theIntegrator); this->record(0); result = theTest->test(); } while (result == -1); if (result == -2) { opserr << "NewtonLineSearch::solveCurrentStep() -"; opserr << "the ConvergenceTest object failed in test()\n"; return -3; } // note - if postive result we are returning what the convergence test returned // which should be the number of iterations return result; } ConvergenceTest * NewtonLineSearch::getConvergenceTest(void) { return theTest; } int NewtonLineSearch::sendSelf(int cTag, Channel &theChannel) { return -1; } int NewtonLineSearch::recvSelf(int cTag, Channel &theChannel, FEM_ObjectBroker &theBroker) { return -1; } void NewtonLineSearch::Print(OPS_Stream &s, int flag) { if (flag == 0) s << "NewtonLineSearch\n"; if (theLineSearch != 0) theLineSearch->Print(s, flag); } Generated on Mon Oct 23 15:04:57 2006 for OpenSees by  1.5.0

---

opensees-support @ berkeley.edu

Supported by the National Science Foundation

©2006, UC Regents