PEER NEES NEESit

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

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

ThreadedSuperLU.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.3 $ // $Date: 2003/02/14 23:02:03 $ // $Source: /usr/local/cvs/OpenSees/SRC/system_of_eqn/linearSOE/sparseGEN/ThreadedSuperLU.cpp,v $ // File: ~/system_of_eqn/linearSOE/sparseGEN/ThreadedSuperLU.h // // Written: fmk // Created: 11/96 // Revision: A // // Description: This file contains the class definition for // ThreadedSuperLU. It solves the FullGenLinSOE object by calling // SuperLU_MT routines. // // What: "@(#) ThreadedSuperLU.h, revA" #include <ThreadedSuperLU.h> #include <SparseGenColLinSOE.h> #include <f2c.h> #include <math.h> #include <Channel.h> #include <FEM_ObjectBroker.h> ThreadedSuperLU:: ThreadedSuperLU(int numT, int perm, int relx, int panel, double thrsh) :SparseGenColLinSolver(SOLVER_TAGS_ThreadedSuperLU), perm_r(0),perm_c(0), etree(0), sizePerm(0), relax(relx), permSpec(perm), panelSize(panel), thresh(thrsh), numThreads(numT), refact(NO), usepr(NO), fact(DOFACT), work(NULL), lwork(0) { refact = NO; fact = DOFACT; usepr = NO; work = NULL; lwork = 0; } ThreadedSuperLU::~ThreadedSuperLU() { if (perm_r != 0) delete [] perm_r; if (perm_c != 0) delete [] perm_c; if (etree != 0) delete [] etree; if (lwork >= 0) { Destroy_SuperNode_SCP(&L); Destroy_CompCol_NCP(&U); } StatFree(&gStat); } int ThreadedSuperLU::solve(void) { if (theSOE == 0) { opserr << "WARNING ThreadedSuperLU::solve(void)- "; opserr << " No LinearSOE object has been set\n"; return -1; } int n = theSOE->size; // check for quick return if (n == 0) return 0; if (sizePerm == 0) { opserr << "WARNING ThreadedSuperLU::solve(void)- "; opserr << " size for row and col permutations 0 - has setSize() been called?\n"; return -1; } // first copy B into X double *Xptr = theSOE->X; double *Bptr = theSOE->B; for (int i=0; i<n; i++) *(Xptr++) = *(Bptr++); if (theSOE->factored == false) { // factor the matrix int info; StatInit(n, numThreads, &gStat); pdgstrf_init(numThreads, refact, panelSize, relax, thresh, usepr, 0.0, perm_c, perm_r, work, lwork, &A, &AC, &pdgstrf_options, &gStat); pdgstrf(&pdgstrf_options, &AC, perm_r, &L, &U, &gStat, &info); if (info != 0) { opserr << "WARNING ThreadedSuperLU::solve(void)- "; opserr << " Error " << info << " returned in factorization dgstrf()\n"; return info; } refact = YES; theSOE->factored = true; } // do forward and backward substitution trans = NOTRANS; int info; dgstrs (trans, &L, &U, perm_r, perm_c, &B, &gStat, &info); if (info != 0) { opserr << "WARNING ThreadedSuperLU::solve(void)- "; opserr << " Error " << info << " returned in substitution dgstrs()\n"; return info; } return 0; } int ThreadedSuperLU::setSize() { int n = theSOE->size; if (n > 0) { // create space for the permutation vectors // and the elimination tree if (sizePerm < n) { if (perm_r != 0) delete [] perm_r; perm_r = new int[n]; if (perm_c != 0) delete [] perm_c; perm_c = new int[n]; if (etree != 0) delete [] etree; etree = new int[n]; if (perm_r == 0 || perm_c == 0 || etree == 0) { opserr << "WARNING ThreadedSuperLU::setSize()"; opserr << " - ran out of memory\n"; sizePerm = 0; return -1; } sizePerm = n; } // initialisation StatAlloc(n, numThreads, panelSize, relax, &gStat); // create the SuperMatrixMT A dCreate_CompCol_Matrix(&A, n, n, theSOE->nnz, theSOE->A, theSOE->rowA, theSOE->colStartA, NC, _D, GE); // obtain and apply column permutation to give SuperMatrixMT AC get_perm_c(permSpec, &A, perm_c); // sp_preorder(refact, &A, perm_c, etree, &AC); // create the rhs SuperMatrixMT B dCreate_Dense_Matrix(&B, n, 1, theSOE->X, n, DN, _D, GE); // set the refact variable to 'N' after first factorization with new size // can set to 'Y'. refact = NO; } else if (n == 0) return 0; else { opserr << "WARNING ThreadedSuperLU::setSize()"; opserr << " - order of system < 0\n"; return -1; } return 0; } int ThreadedSuperLU::sendSelf(int cTag, Channel &theChannel) { // nothing to do return 0; } int ThreadedSuperLU::recvSelf(int cTag, Channel &theChannel, FEM_ObjectBroker &theBroker) { // nothing to do return 0; } Generated on Mon Oct 23 15:05:29 2006 for OpenSees by  1.5.0

---

opensees-support @ berkeley.edu

Supported by the National Science Foundation

©2006, UC Regents