Merge pull request #20 from Ondsel-Development/clang-fix
WIP: Clang fix
This commit is contained in:
@@ -83,7 +83,7 @@ namespace MbD {
|
||||
double calcCharacteristicLength();
|
||||
std::shared_ptr<std::vector<std::shared_ptr<ASMTItemIJ>>> connectorList();
|
||||
std::shared_ptr<std::map<std::string, std::shared_ptr<ASMTMarker>>>markerMap();
|
||||
void deleteMbD();
|
||||
void deleteMbD() override;
|
||||
void createMbD(std::shared_ptr<System> mbdSys, std::shared_ptr<Units> mbdUnits) override;
|
||||
void outputFile(std::string filename);
|
||||
void storeOnLevel(std::ofstream& os, int level) override;
|
||||
|
||||
@@ -22,7 +22,7 @@ namespace MbD {
|
||||
void incrementIterNo() override;
|
||||
void initializeGlobally() override;
|
||||
void logSingularMatrixMessage();
|
||||
void passRootToSystem();
|
||||
void passRootToSystem() override;
|
||||
void postRun() override;
|
||||
void preRun() override;
|
||||
void handleSingularMatrix() override;
|
||||
|
||||
@@ -24,7 +24,7 @@ namespace MbD {
|
||||
void fillY() override;
|
||||
void fillPyPx() override;
|
||||
void passRootToSystem() override;
|
||||
void assignEquationNumbers() = 0;
|
||||
void assignEquationNumbers() override = 0;
|
||||
|
||||
int nqsu = -1;
|
||||
FColDsptr qsuOld;
|
||||
|
||||
@@ -15,9 +15,9 @@ namespace MbD {
|
||||
{
|
||||
//
|
||||
public:
|
||||
void firstStep();
|
||||
void firstStep() override;
|
||||
bool isRedoingFirstStep();
|
||||
void nextStep();
|
||||
void nextStep() override;
|
||||
//void reportStepStats();
|
||||
//void reportTrialStepStats();
|
||||
void runInitialConditionTypeSolution() override;
|
||||
|
||||
@@ -21,13 +21,13 @@ namespace MbD {
|
||||
void calcPostDynCorrectorIteration() override;
|
||||
void initialize() override;
|
||||
void initializeGlobally() override;
|
||||
FRowDsptr ppvaluepXIpt();
|
||||
FRowDsptr ppvaluepEIpt();
|
||||
FRowDsptr ppvaluepEKpt();
|
||||
FRowDsptr ppvaluepXJpt();
|
||||
FRowDsptr ppvaluepEJpt();
|
||||
double ppvalueptpt();
|
||||
double pvaluept();
|
||||
FRowDsptr ppvaluepXIpt() override;
|
||||
FRowDsptr ppvaluepEIpt() override;
|
||||
FRowDsptr ppvaluepEKpt() override;
|
||||
FRowDsptr ppvaluepXJpt() override;
|
||||
FRowDsptr ppvaluepEJpt() override;
|
||||
double ppvalueptpt() override;
|
||||
double pvaluept() override;
|
||||
void preAccIC() override;
|
||||
void preVelIC() override;
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@ namespace MbD {
|
||||
double ppvalueptpt() override;
|
||||
void preAccIC() override;
|
||||
void preVelIC() override;
|
||||
double pvaluept();
|
||||
double pvaluept() override;
|
||||
|
||||
double priIeJeOpt;
|
||||
FRowDsptr ppriIeJeOpEIpt;
|
||||
|
||||
@@ -20,11 +20,11 @@ namespace MbD {
|
||||
|
||||
void calcPrivate() override;
|
||||
void initialize() override;
|
||||
FMatDsptr ppvaluepEIpEI();
|
||||
FMatDsptr ppvaluepXIpEI();
|
||||
FMatDsptr ppvaluepXIpXI();
|
||||
FRowDsptr pvaluepEI();
|
||||
FRowDsptr pvaluepXI();
|
||||
FMatDsptr ppvaluepEIpEI() override;
|
||||
FMatDsptr ppvaluepXIpEI() override;
|
||||
FMatDsptr ppvaluepXIpXI() override;
|
||||
FRowDsptr pvaluepEI() override;
|
||||
FRowDsptr pvaluepXI() override;
|
||||
|
||||
FRowDsptr prIeJepXI, prIeJepEI;
|
||||
FMatDsptr pprIeJepXIpXI, pprIeJepXIpEI, pprIeJepEIpEI, mprIeJeOpEIT;
|
||||
|
||||
@@ -20,15 +20,15 @@ namespace MbD {
|
||||
|
||||
void calcPrivate() override;
|
||||
void initialize() override;
|
||||
FMatDsptr ppvaluepEIpEJ();
|
||||
FMatDsptr ppvaluepEIpXJ();
|
||||
FMatDsptr ppvaluepEJpEJ();
|
||||
FMatDsptr ppvaluepXIpEJ();
|
||||
FMatDsptr ppvaluepXIpXJ();
|
||||
FMatDsptr ppvaluepXJpEJ();
|
||||
FMatDsptr ppvaluepXJpXJ();
|
||||
FRowDsptr pvaluepEJ();
|
||||
FRowDsptr pvaluepXJ();
|
||||
FMatDsptr ppvaluepEIpEJ() override;
|
||||
FMatDsptr ppvaluepEIpXJ() override;
|
||||
FMatDsptr ppvaluepEJpEJ() override;
|
||||
FMatDsptr ppvaluepXIpEJ() override;
|
||||
FMatDsptr ppvaluepXIpXJ() override;
|
||||
FMatDsptr ppvaluepXJpEJ() override;
|
||||
FMatDsptr ppvaluepXJpXJ() override;
|
||||
FRowDsptr pvaluepEJ() override;
|
||||
FRowDsptr pvaluepXJ() override;
|
||||
|
||||
FRowDsptr prIeJepXJ, prIeJepEJ;
|
||||
FMatDsptr pprIeJepXIpXJ, pprIeJepEIpXJ, pprIeJepXJpXJ, pprIeJepXIpEJ, pprIeJepEIpEJ, pprIeJepXJpEJ, pprIeJepEJpEJ, prIeJeOpEJT;
|
||||
|
||||
@@ -10,3 +10,426 @@
|
||||
|
||||
using namespace MbD;
|
||||
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::tildeMatrix(FColDsptr col)
|
||||
{
|
||||
//"tildeMatrix is skew symmetric matrix related to angular velocity and cross product."
|
||||
if (col->size() != 3) throw std::runtime_error("Column is not of dimension 3");
|
||||
auto tilde = std::make_shared<FullMatrix<double>>(3, 3);
|
||||
auto c0 = col->at(0);
|
||||
auto c1 = col->at(1);
|
||||
auto c2 = col->at(2);
|
||||
tilde->atijput(0, 0, 0.0);
|
||||
tilde->atijput(1, 1, 0.0);
|
||||
tilde->atijput(2, 2, 0.0);
|
||||
tilde->atijput(1, 2, -c0);
|
||||
tilde->atijput(0, 2, c1);
|
||||
tilde->atijput(0, 1, -c2);
|
||||
tilde->atijput(1, 0, c2);
|
||||
tilde->atijput(2, 0, -c1);
|
||||
tilde->atijput(2, 1, c0);
|
||||
return tilde;
|
||||
}
|
||||
template<>
|
||||
inline void FullMatrix<double>::zeroSelf()
|
||||
{
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->zeroSelf();
|
||||
}
|
||||
}
|
||||
template<>
|
||||
inline void FullMatrix<double>::identity() {
|
||||
this->zeroSelf();
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->at(i) = 1.0;
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::column(int j) {
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullColumn<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->at(j);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::timesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int m = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(m);
|
||||
for (int i = 0; i < m; i++) {
|
||||
answer->at(i) = this->at(i)->timesFullMatrix(fullMat);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::timesTransposeFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++) {
|
||||
answer->at(i) = this->at(i)->timesTransposeFullMatrix(fullMat);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<>
|
||||
inline FMatDsptr FullMatrix<double>::times(double a)
|
||||
{
|
||||
int m = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<double>>(m);
|
||||
for (int i = 0; i < m; i++) {
|
||||
answer->at(i) = this->at(i)->times(a);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::times(T a)
|
||||
{
|
||||
assert(false);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::transposeTimesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
return this->transpose()->timesFullMatrix(fullMat);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::plusFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->plusFullRow(fullMat->at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::minusFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->minusFullRow(fullMat->at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::transpose()
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto ncol = this->ncol();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(ncol, nrow);
|
||||
for (int i = 0; i < nrow; i++) {
|
||||
auto& row = this->at(i);
|
||||
for (int j = 0; j < ncol; j++) {
|
||||
answer->at(j)->at(i) = row->at(j);
|
||||
}
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::negated()
|
||||
{
|
||||
return this->times(-1.0);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::symLowerWithUpper()
|
||||
{
|
||||
int n = (int)this->size();
|
||||
for (int i = 0; i < n; i++) {
|
||||
for (int j = i + 1; j < n; j++) {
|
||||
this->at(j)->at(i) = this->at(i)->at(j);
|
||||
}
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atiput(int i, FRowsptr<T> fullRow)
|
||||
{
|
||||
this->at(i) = fullRow;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijput(int i, int j, T value)
|
||||
{
|
||||
this->at(i)->atiput(j, value);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijputFullColumn(int i1, int j1, FColsptr<T> fullCol)
|
||||
{
|
||||
for (int ii = 0; ii < fullCol->size(); ii++)
|
||||
{
|
||||
this->at(i1 + ii)->at(j1) = fullCol->at(ii);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijplusFullRow(int i, int j, FRowsptr<T> fullRow)
|
||||
{
|
||||
this->at(i)->atiplusFullRow(j, fullRow);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijplusNumber(int i, int j, T value)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
rowi->at(j) += value;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijminusNumber(int i, int j, T value)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
rowi->at(j) -= value;
|
||||
}
|
||||
template<>
|
||||
inline double FullMatrix<double>::sumOfSquares()
|
||||
{
|
||||
double sum = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
sum += this->at(i)->sumOfSquares();
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
template<typename T>
|
||||
inline double FullMatrix<T>::sumOfSquares()
|
||||
{
|
||||
assert(false);
|
||||
return 0.0;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::zeroSelf()
|
||||
{
|
||||
assert(false);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::copy()
|
||||
{
|
||||
auto m = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(m);
|
||||
for (int i = 0; i < m; i++)
|
||||
{
|
||||
answer->at(i) = this->at(i)->copy();
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FullMatrix<T> FullMatrix<T>::operator+(const FullMatrix<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = FullMatrix<T>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer.at(i) = this->at(i)->plusFullRow(fullMat.at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::transposeTimesFullColumn(FColsptr<T> fullCol)
|
||||
{
|
||||
auto sptr = std::make_shared<FullMatrix<T>>(*this);
|
||||
return fullCol->transpose()->timesFullMatrix(sptr)->transpose();
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::magnifySelf(T factor)
|
||||
{
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->magnifySelf(factor);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline std::ostream& FullMatrix<T>::printOn(std::ostream& s) const
|
||||
{
|
||||
s << "FullMat[" << std::endl;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
s << *(this->at(i)) << std::endl;
|
||||
}
|
||||
s << "]";
|
||||
return s;
|
||||
}
|
||||
template<typename T>
|
||||
inline std::shared_ptr<EulerParameters<T>> FullMatrix<T>::asEulerParameters()
|
||||
{
|
||||
//"Given [A], compute Euler parameter."
|
||||
|
||||
auto traceA = this->trace();
|
||||
T dum = 0.0;
|
||||
T dumSq = 0.0;
|
||||
//auto qE = CREATE<EulerParameters<double>>::With(4); //Cannot use CREATE.h in subclasses of std::vector. Why?
|
||||
auto qE = std::make_shared<EulerParameters<T>>(4);
|
||||
qE->initialize();
|
||||
auto OneMinusTraceDivFour = (1.0 - traceA) / 4.0;
|
||||
for (int i = 0; i < 3; i++)
|
||||
{
|
||||
dumSq = this->at(i)->at(i) / 2.0 + OneMinusTraceDivFour;
|
||||
dum = (dumSq > 0.0) ? std::sqrt(dumSq) : 0.0;
|
||||
qE->atiput(i, dum);
|
||||
}
|
||||
dumSq = (1.0 + traceA) / 4.0;
|
||||
dum = (dumSq > 0.0) ? std::sqrt(dumSq) : 0.0;
|
||||
qE->atiput(3, dum);
|
||||
T max = 0.0;
|
||||
int maxE = -1;
|
||||
for (int i = 0; i < 4; i++)
|
||||
{
|
||||
auto num = qE->at(i);
|
||||
if (max < num) {
|
||||
max = num;
|
||||
maxE = i;
|
||||
}
|
||||
}
|
||||
|
||||
if (maxE == 0) {
|
||||
auto FourE = 4.0 * qE->at(0);
|
||||
qE->atiput(1, (this->at(0)->at(1) + this->at(1)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(0)->at(2) + this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(3, (this->at(2)->at(1) - this->at(1)->at(2)) / FourE);
|
||||
}
|
||||
else if (maxE == 1) {
|
||||
auto FourE = 4.0 * qE->at(1);
|
||||
qE->atiput(0, (this->at(0)->at(1) + this->at(1)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(1)->at(2) + this->at(2)->at(1)) / FourE);
|
||||
qE->atiput(3, (this->at(0)->at(2) - this->at(2)->at(0)) / FourE);
|
||||
}
|
||||
else if (maxE == 2) {
|
||||
auto FourE = 4.0 * qE->at(2);
|
||||
qE->atiput(0, (this->at(0)->at(2) + this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(1, (this->at(1)->at(2) + this->at(2)->at(1)) / FourE);
|
||||
qE->atiput(3, (this->at(1)->at(0) - this->at(0)->at(1)) / FourE);
|
||||
}
|
||||
else if (maxE == 3) {
|
||||
auto FourE = 4.0 * qE->at(3);
|
||||
qE->atiput(0, (this->at(2)->at(1) - this->at(1)->at(2)) / FourE);
|
||||
qE->atiput(1, (this->at(0)->at(2) - this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(1)->at(0) - this->at(0)->at(1)) / FourE);
|
||||
}
|
||||
qE->conditionSelf();
|
||||
qE->calc();
|
||||
return qE;
|
||||
}
|
||||
template<typename T>
|
||||
inline T FullMatrix<T>::trace()
|
||||
{
|
||||
T trace = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
trace += this->at(i)->at(i);
|
||||
}
|
||||
return trace;
|
||||
}
|
||||
template<typename T>
|
||||
inline double FullMatrix<T>::maxMagnitude()
|
||||
{
|
||||
double max = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
double element = this->at(i)->maxMagnitude();
|
||||
if (max < element) max = element;
|
||||
}
|
||||
return max;
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::bryantAngles()
|
||||
{
|
||||
auto answer = std::make_shared<FullColumn<T>>(3);
|
||||
auto sthe1y = this->at(0)->at(2);
|
||||
T the0x, the1y, the2z, cthe0x, sthe0x, y, x;
|
||||
if (std::abs(sthe1y) > 0.9999) {
|
||||
if (sthe1y > 0.0) {
|
||||
the0x = std::atan2(this->at(1)->at(0), this->at(1)->at(1));
|
||||
the1y = M_PI / 2.0;
|
||||
the2z = 0.0;
|
||||
}
|
||||
else {
|
||||
the0x = std::atan2(this->at(2)->at(1), this->at(2)->at(0));
|
||||
the1y = M_PI / -2.0;
|
||||
the2z = 0.0;
|
||||
}
|
||||
}
|
||||
else {
|
||||
the0x = std::atan2(-this->at(1)->at(2), this->at(2)->at(2));
|
||||
cthe0x = std::cos(the0x);
|
||||
sthe0x = std::sin(the0x);
|
||||
y = sthe1y;
|
||||
if (std::abs(cthe0x) > std::abs(sthe0x)) {
|
||||
x = this->at(2)->at(2) / cthe0x;
|
||||
}
|
||||
else {
|
||||
x = this->at(1)->at(2) / -sthe0x;
|
||||
}
|
||||
the1y = std::atan2(y, x);
|
||||
the2z = std::atan2(-this->at(0)->at(1), this->at(0)->at(0));
|
||||
}
|
||||
answer->atiput(0, the0x);
|
||||
answer->atiput(1, the1y);
|
||||
answer->atiput(2, the2z);
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline bool FullMatrix<T>::isDiagonal()
|
||||
{
|
||||
auto m = this->nrow();
|
||||
auto n = this->ncol();
|
||||
if (m != n) return false;
|
||||
for (int i = 0; i < m; i++)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
for (int j = 0; j < n; j++)
|
||||
{
|
||||
if (i != j && rowi->at(j) != 0) return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
template<typename T>
|
||||
inline bool FullMatrix<T>::isDiagonalToWithin(double ratio)
|
||||
{
|
||||
double maxMag = this->maxMagnitude();
|
||||
auto tol = ratio * maxMag;
|
||||
auto nrow = this->nrow();
|
||||
if (nrow == this->ncol()) {
|
||||
for (int i = 0; i < 3; i++)
|
||||
{
|
||||
for (int j = i + 1; j < 3; j++)
|
||||
{
|
||||
if (std::abs(this->at(i)->at(j)) > tol) return false;
|
||||
if (std::abs(this->at(j)->at(i)) > tol) return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
else {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline std::shared_ptr<DiagonalMatrix<T>> FullMatrix<T>::asDiagonalMatrix()
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto diagMat = std::make_shared<DiagonalMatrix<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
diagMat->atiput(i, this->at(i)->at(i));
|
||||
}
|
||||
return diagMat;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::conditionSelfWithTol(double tol)
|
||||
{
|
||||
for (auto row : *this) {
|
||||
row->conditionSelfWithTol(tol);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::timesFullColumn(FColsptr<T> fullCol)
|
||||
{
|
||||
return this->timesFullColumn(fullCol.get());
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::timesFullColumn(FullColumn<T>* fullCol)
|
||||
{
|
||||
//"a*b = a(i,j)b(j) sum j."
|
||||
auto nrow = this->nrow();
|
||||
auto answer = std::make_shared<FullColumn<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
answer->at(i) = this->at(i)->timesFullColumn(fullCol);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
|
||||
@@ -11,22 +11,32 @@
|
||||
#include "corecrt_math_defines.h"
|
||||
#include <memory>
|
||||
|
||||
#include "FullRow.h"
|
||||
#include "RowTypeMatrix.h"
|
||||
#include "FullColumn.h"
|
||||
|
||||
namespace MbD {
|
||||
template<typename T>
|
||||
class FullMatrix;
|
||||
template<typename T>
|
||||
class FullMatrix;
|
||||
|
||||
using FMatDsptr = std::shared_ptr<FullMatrix<double>>;
|
||||
|
||||
template<typename T>
|
||||
using FMatsptr = std::shared_ptr<FullMatrix<T>>;
|
||||
|
||||
template<typename T>
|
||||
class FullColumn;
|
||||
using FColDsptr = std::shared_ptr<FullColumn<double>>;
|
||||
|
||||
template<typename T>
|
||||
class FullRow;
|
||||
|
||||
template<typename T>
|
||||
class RowTypeMatrix;
|
||||
|
||||
template<typename T>
|
||||
class EulerParameters;
|
||||
|
||||
template<typename T>
|
||||
class DiagonalMatrix;
|
||||
|
||||
@@ -85,7 +95,7 @@ namespace MbD {
|
||||
FMatsptr<T> transpose();
|
||||
FMatsptr<T> negated();
|
||||
void symLowerWithUpper();
|
||||
void atiput(int i, FRowsptr<T> fullRow);
|
||||
void atiput(int i, FRowsptr<T> fullRow) override;
|
||||
void atijput(int i, int j, T value);
|
||||
void atijputFullColumn(int i, int j, FColsptr<T> fullCol);
|
||||
void atijplusFullRow(int i, int j, FRowsptr<T> fullRow);
|
||||
@@ -313,428 +323,5 @@ namespace MbD {
|
||||
mat->identity();
|
||||
return mat;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::tildeMatrix(FColDsptr col)
|
||||
{
|
||||
//"tildeMatrix is skew symmetric matrix related to angular velocity and cross product."
|
||||
if (col->size() != 3) throw std::runtime_error("Column is not of dimension 3");
|
||||
auto tilde = std::make_shared<FullMatrix<double>>(3, 3);
|
||||
auto c0 = col->at(0);
|
||||
auto c1 = col->at(1);
|
||||
auto c2 = col->at(2);
|
||||
tilde->atijput(0, 0, 0.0);
|
||||
tilde->atijput(1, 1, 0.0);
|
||||
tilde->atijput(2, 2, 0.0);
|
||||
tilde->atijput(1, 2, -c0);
|
||||
tilde->atijput(0, 2, c1);
|
||||
tilde->atijput(0, 1, -c2);
|
||||
tilde->atijput(1, 0, c2);
|
||||
tilde->atijput(2, 0, -c1);
|
||||
tilde->atijput(2, 1, c0);
|
||||
return tilde;
|
||||
}
|
||||
template<>
|
||||
inline void FullMatrix<double>::zeroSelf()
|
||||
{
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->zeroSelf();
|
||||
}
|
||||
}
|
||||
template<>
|
||||
inline void FullMatrix<double>::identity() {
|
||||
this->zeroSelf();
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->at(i) = 1.0;
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::column(int j) {
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullColumn<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->at(j);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::timesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int m = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(m);
|
||||
for (int i = 0; i < m; i++) {
|
||||
answer->at(i) = this->at(i)->timesFullMatrix(fullMat);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::timesTransposeFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++) {
|
||||
answer->at(i) = this->at(i)->timesTransposeFullMatrix(fullMat);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<>
|
||||
inline FMatDsptr FullMatrix<double>::times(double a)
|
||||
{
|
||||
int m = this->nrow();
|
||||
auto answer = std::make_shared<FullMatrix<double>>(m);
|
||||
for (int i = 0; i < m; i++) {
|
||||
answer->at(i) = this->at(i)->times(a);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::times(T a)
|
||||
{
|
||||
assert(false);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::transposeTimesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
return this->transpose()->timesFullMatrix(fullMat);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::plusFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->plusFullRow(fullMat->at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::minusFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer->at(i) = this->at(i)->minusFullRow(fullMat->at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::transpose()
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto ncol = this->ncol();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(ncol, nrow);
|
||||
for (int i = 0; i < nrow; i++) {
|
||||
auto& row = this->at(i);
|
||||
for (int j = 0; j < ncol; j++) {
|
||||
answer->at(j)->at(i) = row->at(j);
|
||||
}
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::negated()
|
||||
{
|
||||
return this->times(-1.0);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::symLowerWithUpper()
|
||||
{
|
||||
int n = (int)this->size();
|
||||
for (int i = 0; i < n; i++) {
|
||||
for (int j = i + 1; j < n; j++) {
|
||||
this->at(j)->at(i) = this->at(i)->at(j);
|
||||
}
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atiput(int i, FRowsptr<T> fullRow)
|
||||
{
|
||||
this->at(i) = fullRow;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijput(int i, int j, T value)
|
||||
{
|
||||
this->at(i)->atiput(j, value);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijputFullColumn(int i1, int j1, FColsptr<T> fullCol)
|
||||
{
|
||||
for (int ii = 0; ii < fullCol->size(); ii++)
|
||||
{
|
||||
this->at(i1 + ii)->at(j1) = fullCol->at(ii);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijplusFullRow(int i, int j, FRowsptr<T> fullRow)
|
||||
{
|
||||
this->at(i)->atiplusFullRow(j, fullRow);
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijplusNumber(int i, int j, T value)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
rowi->at(j) += value;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::atijminusNumber(int i, int j, T value)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
rowi->at(j) -= value;
|
||||
}
|
||||
template<>
|
||||
inline double FullMatrix<double>::sumOfSquares()
|
||||
{
|
||||
double sum = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
sum += this->at(i)->sumOfSquares();
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
template<typename T>
|
||||
inline double FullMatrix<T>::sumOfSquares()
|
||||
{
|
||||
assert(false);
|
||||
return 0.0;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::zeroSelf()
|
||||
{
|
||||
assert(false);
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullMatrix<T>::copy()
|
||||
{
|
||||
auto m = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<T>>(m);
|
||||
for (int i = 0; i < m; i++)
|
||||
{
|
||||
answer->at(i) = this->at(i)->copy();
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FullMatrix<T> FullMatrix<T>::operator+(const FullMatrix<T> fullMat)
|
||||
{
|
||||
int n = (int)this->size();
|
||||
auto answer = FullMatrix<T>(n);
|
||||
for (int i = 0; i < n; i++) {
|
||||
answer.at(i) = this->at(i)->plusFullRow(fullMat.at(i));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::transposeTimesFullColumn(FColsptr<T> fullCol)
|
||||
{
|
||||
auto sptr = std::make_shared<FullMatrix<T>>(*this);
|
||||
return fullCol->transpose()->timesFullMatrix(sptr)->transpose();
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::magnifySelf(T factor)
|
||||
{
|
||||
for (int i = 0; i < this->size(); i++) {
|
||||
this->at(i)->magnifySelf(factor);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline std::ostream& FullMatrix<T>::printOn(std::ostream& s) const
|
||||
{
|
||||
s << "FullMat[" << std::endl;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
s << *(this->at(i)) << std::endl;
|
||||
}
|
||||
s << "]";
|
||||
return s;
|
||||
}
|
||||
template<typename T>
|
||||
inline std::shared_ptr<EulerParameters<T>> FullMatrix<T>::asEulerParameters()
|
||||
{
|
||||
//"Given [A], compute Euler parameter."
|
||||
|
||||
auto traceA = this->trace();
|
||||
T dum = 0.0;
|
||||
T dumSq = 0.0;
|
||||
//auto qE = CREATE<EulerParameters<double>>::With(4); //Cannot use CREATE.h in subclasses of std::vector. Why?
|
||||
auto qE = std::make_shared<EulerParameters<T>>(4);
|
||||
qE->initialize();
|
||||
auto OneMinusTraceDivFour = (1.0 - traceA) / 4.0;
|
||||
for (int i = 0; i < 3; i++)
|
||||
{
|
||||
dumSq = this->at(i)->at(i) / 2.0 + OneMinusTraceDivFour;
|
||||
dum = (dumSq > 0.0) ? std::sqrt(dumSq) : 0.0;
|
||||
qE->atiput(i, dum);
|
||||
}
|
||||
dumSq = (1.0 + traceA) / 4.0;
|
||||
dum = (dumSq > 0.0) ? std::sqrt(dumSq) : 0.0;
|
||||
qE->atiput(3, dum);
|
||||
T max = 0.0;
|
||||
int maxE = -1;
|
||||
for (int i = 0; i < 4; i++)
|
||||
{
|
||||
auto num = qE->at(i);
|
||||
if (max < num) {
|
||||
max = num;
|
||||
maxE = i;
|
||||
}
|
||||
}
|
||||
|
||||
if (maxE == 0) {
|
||||
auto FourE = 4.0 * qE->at(0);
|
||||
qE->atiput(1, (this->at(0)->at(1) + this->at(1)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(0)->at(2) + this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(3, (this->at(2)->at(1) - this->at(1)->at(2)) / FourE);
|
||||
}
|
||||
else if (maxE == 1) {
|
||||
auto FourE = 4.0 * qE->at(1);
|
||||
qE->atiput(0, (this->at(0)->at(1) + this->at(1)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(1)->at(2) + this->at(2)->at(1)) / FourE);
|
||||
qE->atiput(3, (this->at(0)->at(2) - this->at(2)->at(0)) / FourE);
|
||||
}
|
||||
else if (maxE == 2) {
|
||||
auto FourE = 4.0 * qE->at(2);
|
||||
qE->atiput(0, (this->at(0)->at(2) + this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(1, (this->at(1)->at(2) + this->at(2)->at(1)) / FourE);
|
||||
qE->atiput(3, (this->at(1)->at(0) - this->at(0)->at(1)) / FourE);
|
||||
}
|
||||
else if (maxE == 3) {
|
||||
auto FourE = 4.0 * qE->at(3);
|
||||
qE->atiput(0, (this->at(2)->at(1) - this->at(1)->at(2)) / FourE);
|
||||
qE->atiput(1, (this->at(0)->at(2) - this->at(2)->at(0)) / FourE);
|
||||
qE->atiput(2, (this->at(1)->at(0) - this->at(0)->at(1)) / FourE);
|
||||
}
|
||||
qE->conditionSelf();
|
||||
qE->calc();
|
||||
return qE;
|
||||
}
|
||||
template<typename T>
|
||||
inline T FullMatrix<T>::trace()
|
||||
{
|
||||
T trace = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
trace += this->at(i)->at(i);
|
||||
}
|
||||
return trace;
|
||||
}
|
||||
template<typename T>
|
||||
inline double FullMatrix<T>::maxMagnitude()
|
||||
{
|
||||
double max = 0.0;
|
||||
for (int i = 0; i < this->size(); i++)
|
||||
{
|
||||
double element = this->at(i)->maxMagnitude();
|
||||
if (max < element) max = element;
|
||||
}
|
||||
return max;
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::bryantAngles()
|
||||
{
|
||||
auto answer = std::make_shared<FullColumn<T>>(3);
|
||||
auto sthe1y = this->at(0)->at(2);
|
||||
T the0x, the1y, the2z, cthe0x, sthe0x, y, x;
|
||||
if (std::abs(sthe1y) > 0.9999) {
|
||||
if (sthe1y > 0.0) {
|
||||
the0x = std::atan2(this->at(1)->at(0), this->at(1)->at(1));
|
||||
the1y = M_PI / 2.0;
|
||||
the2z = 0.0;
|
||||
}
|
||||
else {
|
||||
the0x = std::atan2(this->at(2)->at(1), this->at(2)->at(0));
|
||||
the1y = M_PI / -2.0;
|
||||
the2z = 0.0;
|
||||
}
|
||||
}
|
||||
else {
|
||||
the0x = std::atan2(-this->at(1)->at(2), this->at(2)->at(2));
|
||||
cthe0x = std::cos(the0x);
|
||||
sthe0x = std::sin(the0x);
|
||||
y = sthe1y;
|
||||
if (std::abs(cthe0x) > std::abs(sthe0x)) {
|
||||
x = this->at(2)->at(2) / cthe0x;
|
||||
}
|
||||
else {
|
||||
x = this->at(1)->at(2) / -sthe0x;
|
||||
}
|
||||
the1y = std::atan2(y, x);
|
||||
the2z = std::atan2(-this->at(0)->at(1), this->at(0)->at(0));
|
||||
}
|
||||
answer->atiput(0, the0x);
|
||||
answer->atiput(1, the1y);
|
||||
answer->atiput(2, the2z);
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline bool FullMatrix<T>::isDiagonal()
|
||||
{
|
||||
auto m = this->nrow();
|
||||
auto n = this->ncol();
|
||||
if (m != n) return false;
|
||||
for (int i = 0; i < m; i++)
|
||||
{
|
||||
auto rowi = this->at(i);
|
||||
for (int j = 0; j < n; j++)
|
||||
{
|
||||
if (i != j && rowi->at(j) != 0) return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
template<typename T>
|
||||
inline bool FullMatrix<T>::isDiagonalToWithin(double ratio)
|
||||
{
|
||||
double maxMag = this->maxMagnitude();
|
||||
auto tol = ratio * maxMag;
|
||||
auto nrow = this->nrow();
|
||||
if (nrow == this->ncol()) {
|
||||
for (int i = 0; i < 3; i++)
|
||||
{
|
||||
for (int j = i + 1; j < 3; j++)
|
||||
{
|
||||
if (std::abs(this->at(i)->at(j)) > tol) return false;
|
||||
if (std::abs(this->at(j)->at(i)) > tol) return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
else {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline std::shared_ptr<DiagonalMatrix<T>> FullMatrix<T>::asDiagonalMatrix()
|
||||
{
|
||||
int nrow = this->nrow();
|
||||
auto diagMat = std::make_shared<DiagonalMatrix<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
diagMat->atiput(i, this->at(i)->at(i));
|
||||
}
|
||||
return diagMat;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullMatrix<T>::conditionSelfWithTol(double tol)
|
||||
{
|
||||
for (auto row : *this) {
|
||||
row->conditionSelfWithTol(tol);
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::timesFullColumn(FColsptr<T> fullCol)
|
||||
{
|
||||
return this->timesFullColumn(fullCol.get());
|
||||
}
|
||||
template<typename T>
|
||||
inline FColsptr<T> FullMatrix<T>::timesFullColumn(FullColumn<T>* fullCol)
|
||||
{
|
||||
//"a*b = a(i,j)b(j) sum j."
|
||||
auto nrow = this->nrow();
|
||||
auto answer = std::make_shared<FullColumn<T>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
answer->at(i) = this->at(i)->timesFullColumn(fullCol);
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -9,3 +9,40 @@
|
||||
#include "FullRow.h"
|
||||
|
||||
using namespace MbD;
|
||||
|
||||
template<typename T>
|
||||
FMatsptr<T> FullRow<T>::transposeTimesFullRow(FRowsptr<T> fullRow)
|
||||
{
|
||||
//"a*b = a(i)b(j)"
|
||||
auto nrow = (int)this->size();
|
||||
auto answer = std::make_shared<MbD::FullMatrix<double>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
answer->atiput(i, fullRow->times(this->at(i)));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
inline FRowsptr<T> FullRow<T>::timesTransposeFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
//"a*bT = a(1,j)b(k,j)"
|
||||
int ncol = fullMat->nrow();
|
||||
auto answer = std::make_shared<FullRow<T>>(ncol);
|
||||
for (int k = 0; k < ncol; k++) {
|
||||
answer->at(k) = this->dot(fullMat->at(k));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
inline FRowsptr<T> FullRow<T>::timesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
FRowsptr<T> answer = fullMat->at(0)->times(this->at(0));
|
||||
for (int j = 1; j < (int) this->size(); j++)
|
||||
{
|
||||
answer->equalSelfPlusFullRowTimes(fullMat->at(j), this->at(j));
|
||||
}
|
||||
return answer;
|
||||
//return FRowsptr<T>();
|
||||
}
|
||||
|
||||
@@ -9,7 +9,7 @@
|
||||
#pragma once
|
||||
|
||||
#include "FullVector.h"
|
||||
//#include "FullColumn.h"
|
||||
#include "FullMatrix.h"
|
||||
|
||||
namespace MbD {
|
||||
template<typename T>
|
||||
@@ -18,14 +18,12 @@ namespace MbD {
|
||||
using FRowsptr = std::shared_ptr<FullRow<T>>;
|
||||
using FRowDsptr = std::shared_ptr<FullRow<double>>;
|
||||
template<typename T>
|
||||
class FullMatrix;
|
||||
template<typename T>
|
||||
using FMatsptr = std::shared_ptr<FullMatrix<T>>;
|
||||
template<typename T>
|
||||
class FullColumn;
|
||||
template<typename T>
|
||||
using FColsptr = std::shared_ptr<FullColumn<T>>;
|
||||
using ListFRD = std::initializer_list<FRowDsptr>;
|
||||
template<typename T>
|
||||
class FullMatrix;
|
||||
|
||||
template<typename T>
|
||||
class FullRow : public FullVector<T>
|
||||
@@ -43,14 +41,14 @@ namespace MbD {
|
||||
FRowsptr<T> minusFullRow(FRowsptr<T> fullRow);
|
||||
T timesFullColumn(FColsptr<T> fullCol);
|
||||
T timesFullColumn(FullColumn<T>* fullCol);
|
||||
FRowsptr<T> timesFullMatrix(FMatsptr<T> fullMat);
|
||||
FRowsptr<T> timesTransposeFullMatrix(FMatsptr<T> fullMat);
|
||||
FRowsptr<T> timesFullMatrix(std::shared_ptr<FullMatrix<T>> fullMat);
|
||||
FRowsptr<T> timesTransposeFullMatrix(std::shared_ptr<FullMatrix<T>> fullMat);
|
||||
void equalSelfPlusFullRowTimes(FRowsptr<T> fullRow, double factor);
|
||||
void equalFullRow(FRowsptr<T> fullRow);
|
||||
FColsptr<T> transpose();
|
||||
FRowsptr<T> copy();
|
||||
void atiplusFullRow(int j, FRowsptr<T> fullRow);
|
||||
FMatsptr<T> transposeTimesFullRow(FRowsptr<T> fullRow);
|
||||
std::shared_ptr<FullMatrix<T>> transposeTimesFullRow(FRowsptr<T> fullRow);
|
||||
std::ostream& printOn(std::ostream& s) const override;
|
||||
|
||||
};
|
||||
@@ -111,17 +109,6 @@ namespace MbD {
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline FRowsptr<T> FullRow<T>::timesTransposeFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
//"a*bT = a(1,j)b(k,j)"
|
||||
int ncol = fullMat->nrow();
|
||||
auto answer = std::make_shared<FullRow<T>>(ncol);
|
||||
for (int k = 0; k < ncol; k++) {
|
||||
answer->at(k) = this->dot(fullMat->at(k));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline void FullRow<T>::equalSelfPlusFullRowTimes(FRowsptr<T> fullRow, double factor)
|
||||
{
|
||||
this->equalSelfPlusFullVectortimes(fullRow, factor);
|
||||
@@ -157,18 +144,6 @@ namespace MbD {
|
||||
}
|
||||
}
|
||||
template<typename T>
|
||||
inline FMatsptr<T> FullRow<T>::transposeTimesFullRow(FRowsptr<T> fullRow)
|
||||
{
|
||||
//"a*b = a(i)b(j)"
|
||||
auto nrow = (int)this->size();
|
||||
auto answer = std::make_shared<FullMatrix<double>>(nrow);
|
||||
for (int i = 0; i < nrow; i++)
|
||||
{
|
||||
answer->atiput(i, fullRow->times(this->at(i)));
|
||||
}
|
||||
return answer;
|
||||
}
|
||||
template<typename T>
|
||||
inline std::ostream& FullRow<T>::printOn(std::ostream& s) const
|
||||
{
|
||||
s << "FullRow{";
|
||||
@@ -180,16 +155,5 @@ namespace MbD {
|
||||
s << "}";
|
||||
return s;
|
||||
}
|
||||
template<typename T>
|
||||
inline FRowsptr<T> FullRow<T>::timesFullMatrix(FMatsptr<T> fullMat)
|
||||
{
|
||||
FRowsptr<T> answer = fullMat->at(0)->times(this->at(0));
|
||||
for (int j = 1; j < (int) this->size(); j++)
|
||||
{
|
||||
answer->equalSelfPlusFullRowTimes(fullMat->at(j), this->at(j));
|
||||
}
|
||||
return answer;
|
||||
//return FRowsptr<T>();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -16,7 +16,7 @@ namespace MbD {
|
||||
{
|
||||
//markowitzPivotRowCount markowitzPivotColCount privateIndicesOfNonZerosInPivotRow rowPositionsOfNonZerosInPivotColumn
|
||||
public:
|
||||
FColDsptr solvewithsaveOriginal(SpMatDsptr spMat, FColDsptr fullCol, bool saveOriginal);
|
||||
FColDsptr solvewithsaveOriginal(SpMatDsptr spMat, FColDsptr fullCol, bool saveOriginal) override;
|
||||
FColDsptr basicSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr fullCol, bool saveOriginal) override;
|
||||
FColDsptr basicSolvewithsaveOriginal(FMatDsptr fullMat, FColDsptr fullCol, bool saveOriginal) override;
|
||||
void preSolvewithsaveOriginal(FMatDsptr fullMat, FColDsptr fullCol, bool saveOriginal) override;
|
||||
|
||||
@@ -20,7 +20,7 @@ namespace MbD {
|
||||
public:
|
||||
|
||||
void initializeGlobally() override;
|
||||
virtual void preRun() = 0;
|
||||
virtual void preRun() override = 0;
|
||||
virtual void checkForDiscontinuity() = 0;
|
||||
|
||||
void setSystem(Solver* sys) override;
|
||||
|
||||
@@ -151,13 +151,14 @@ namespace MbD {
|
||||
virtual std::ostream& printOn(std::ostream& s) const;
|
||||
friend std::ostream& operator<<(std::ostream& s, const Item& item)
|
||||
{
|
||||
if (&item) {
|
||||
// the following if cannot be false
|
||||
// if (&item) {
|
||||
return item.printOn(s);
|
||||
}
|
||||
else {
|
||||
s << "NULL";
|
||||
}
|
||||
return s;
|
||||
// }
|
||||
// else {
|
||||
// s << "NULL";
|
||||
// }
|
||||
//return s;
|
||||
}
|
||||
|
||||
std::string name;
|
||||
|
||||
@@ -19,7 +19,7 @@ namespace MbD {
|
||||
FColDsptr basicSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr fullCol, bool saveOriginal) override;
|
||||
void decomposesaveOriginal(FMatDsptr fullMat, bool saveOriginal);
|
||||
void decomposesaveOriginal(SpMatDsptr spMat, bool saveOriginal);
|
||||
FColDsptr forAndBackSubsaveOriginal(FColDsptr fullCol, bool saveOriginal);
|
||||
FColDsptr forAndBackSubsaveOriginal(FColDsptr fullCol, bool saveOriginal) override;
|
||||
double getmatrixArowimaxMagnitude(int i) override;
|
||||
void forwardSubstituteIntoL() override;
|
||||
void backSubstituteIntoDU() override;
|
||||
|
||||
@@ -14,7 +14,7 @@ namespace MbD {
|
||||
class MBDynMarker : public MBDynItem
|
||||
{
|
||||
public:
|
||||
void parseMBDyn(std::vector<std::string>& args);
|
||||
void parseMBDyn(std::vector<std::string>& args) override;
|
||||
void createASMT() override;
|
||||
|
||||
std::string nodeStr;
|
||||
|
||||
@@ -97,7 +97,7 @@ bool PosICNewtonRaphson::isConverged()
|
||||
void PosICNewtonRaphson::handleSingularMatrix()
|
||||
{
|
||||
nSingularMatrixError++;
|
||||
if (nSingularMatrixError = 1){
|
||||
if (nSingularMatrixError == 1){
|
||||
this->lookForRedundantConstraints();
|
||||
matrixSolver = this->matrixSolverClassNew();
|
||||
}
|
||||
|
||||
@@ -21,7 +21,7 @@ namespace MbD {
|
||||
RowTypeMatrix(int m) : Array<T>(m) {}
|
||||
RowTypeMatrix(std::initializer_list<T> list) : Array<T>{ list } {}
|
||||
void copyFrom(std::shared_ptr<RowTypeMatrix<T>> x);
|
||||
virtual void zeroSelf() = 0;
|
||||
virtual void zeroSelf() override = 0;
|
||||
//double maxMagnitude() override;
|
||||
int numberOfElements() override;
|
||||
|
||||
|
||||
@@ -40,7 +40,7 @@ namespace MbD {
|
||||
this->push_back(row);
|
||||
}
|
||||
}
|
||||
void atiput(int i, SpRowsptr<T> spRow);
|
||||
void atiput(int i, SpRowsptr<T> spRow) override;
|
||||
void atijplusDiagonalMatrix(int i, int j, DiagMatDsptr diagMat);
|
||||
void atijminusDiagonalMatrix(int i, int j, DiagMatDsptr diagMat);
|
||||
double sumOfSquares() override;
|
||||
|
||||
@@ -19,7 +19,7 @@ namespace MbD {
|
||||
//
|
||||
public:
|
||||
void initializeGlobally() override;
|
||||
virtual void assignEquationNumbers() = 0;
|
||||
virtual void assignEquationNumbers() override = 0;
|
||||
virtual void createVectorsAndMatrices();
|
||||
std::shared_ptr<MatrixSolver> matrixSolverClassNew() override;
|
||||
void calcdxNorm() override;
|
||||
|
||||
Reference in New Issue
Block a user