File: onsolver.cpp

package info (click to toggle)
lammps 20220106.git7586adbb6a%2Bds1-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 348,064 kB
  • sloc: cpp: 831,421; python: 24,896; xml: 14,949; f90: 10,845; ansic: 7,967; sh: 4,226; perl: 4,064; fortran: 2,424; makefile: 1,501; objc: 238; lisp: 163; csh: 16; awk: 14; tcl: 6
file content (148 lines) | stat: -rw-r--r-- 3,769 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
/*
 *_________________________________________________________________________*
 *      POEMS: PARALLELIZABLE OPEN SOURCE EFFICIENT MULTIBODY SOFTWARE     *
 *      DESCRIPTION: SEE READ-ME                                           *
 *      FILE NAME: onsolver.cpp                                            *
 *      AUTHORS: See Author List                                           *
 *      GRANTS: See Grants List                                            *
 *      COPYRIGHT: (C) 2005 by Authors as listed in Author's List          *
 *      LICENSE: Please see License Agreement                              *
 *      DOWNLOAD: Free at www.rpi.edu/~anderk5                             *
 *      ADMINISTRATOR: Prof. Kurt Anderson                                 *
 *                     Computational Dynamics Lab                          *
 *                     Rensselaer Polytechnic Institute                    *
 *                     110 8th St. Troy NY 12180                           *
 *      CONTACT:        anderk5@rpi.edu                                    *
 *_________________________________________________________________________*/


#include "onsolver.h"
#include "system.h"
#include "onbody.h"
#include "body.h"
#include "matrixfun.h"
#include <fstream>


using namespace std;

OnSolver::OnSolver(){
  numbodies = 0;
  bodyarray = 0;
  q=0;u=0; qdot=0; udot=0; qdotdot=0;
  type = ONSOLVER;
}

OnSolver::~OnSolver(){
  DeleteModel();
}

void OnSolver::DeleteModel(){
  delete [] bodyarray;

  delete [] q;
  delete [] u;

  delete [] qdot;
  delete [] udot;

  delete [] qdotdot;

  numbodies = 0;
}

void OnSolver::CreateModel(){
  // delete old model
  DeleteModel();

  // clear system body IDs (primer for traversal algorithm)
  system->ClearBodyIDs();


  // error check for inertial frame
  Body* sysbasebody = system->bodies.GetHeadElement()->value;
  if( sysbasebody->GetType() != INERTIALFRAME ){
    cerr << "ERROR: inertial frame not at head of bodies list" << endl;
    exit(1);
  }

  // setup the O(n) spanning tree
  numbodies = inertialframe.RecursiveSetup( (InertialFrame*) sysbasebody );
  if(!numbodies){
    cerr << "ERROR: unable to create O(n) model" << endl;
    exit(1);
  }



  bodyarray = new OnBody* [numbodies];

  CreateTopologyArray(0,&inertialframe);

  CreateStateMatrixMaps();
}

int OnSolver::CreateTopologyArray(int num, OnBody* body){
  int i = num;
  bodyarray[i] = body;
  i++;


  OnBody* child;
  ListElement<OnBody>* ele = body->children.GetHeadElement();

  while(ele){
    child = ele->value;
    i = CreateTopologyArray(i,child);
    ele = ele->next;
  }
  return i;
}

void OnSolver::CreateStateMatrixMaps(){


  int numstates=0;
  for(int i=1;i<numbodies;i++)
    numstates += bodyarray[i]->q->GetNumRows();

  state.Dim(numstates);
  statedot.Dim(numstates);
  statedoubledot.Dim(numstates);


  int count=0;

  for(int i=1;i<numbodies;i++){
    for(int j=0;j<bodyarray[i]->q->GetNumRows();j++){
      state.SetElementPointer(count,bodyarray[i]->q->GetElementPointer(j));
      statedot.SetElementPointer(count,bodyarray[i]->qdot->GetElementPointer(j));
      statedoubledot.SetElementPointer(count,bodyarray[i]->qdotdot->GetElementPointer(j));
      count++;
    }
  }
}


void OnSolver::Solve(double time, Matrix& FF){
  system->SetTime(time);
  for(int i=1;i<numbodies;i++)
    bodyarray[i]->LocalKinematics();

  Vect3 Torque; Torque.Zeros();
  Vect3 Force; Force.Zeros();

  for(int i=numbodies-1;i>0;i--){
    Torque(1)=FF(1,i);
    Torque(2)=FF(2,i);
    Torque(3)=FF(3,i);
    Force(1)=FF(4,i);
    Force(2)=FF(5,i);
    Force(3)=FF(6,i);
    bodyarray[i]->LocalTriangularization(Torque,Force);
  }

  for(int i=1;i<numbodies;i++){
    bodyarray[i]->LocalForwardSubstitution();
  }
}