kindred/solver
1
0
Fork 0
Code Issues 10 Pull Requests 1 Actions Packages Projects Releases Wiki Activity

AllowRotation and size_t

Browse Source
This commit is contained in:
Aik-Siong Koh
2024-01-14 21:40:33 -07:00
committed by PaddleStroke
parent fe99ad2593
commit 85557e1fa4
285 changed files with 1854 additions and 1116 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
OndselSolver/LDUSpMat.cpp
View File

@@ -34,7 +34,7 @@ FColDsptr LDUSpMat::forAndBackSubsaveOriginal(FColDsptr, bool)
return FColDsptr();
}
double LDUSpMat::getmatrixArowimaxMagnitude(int i)
double LDUSpMat::getmatrixArowimaxMagnitude(size_t i)
{
return matrixA->at(i)->maxMagnitude();
}
@@ -44,12 +44,12 @@ void LDUSpMat::forwardSubstituteIntoL()
//"L is lower triangular with nonzero and ones in diagonal."
auto vectorc = std::make_shared<FullColumn<double>>(n);
vectorc->at(0) = rightHandSideB->at(0);
for (int i = 1; i < n; i++)
for (size_t i = 1; i < n; i++)
{
auto rowi = matrixA->at(i);
double sum = 0.0;
for (auto const& keyValue : *rowi) {
int j = keyValue.first;
size_t j = keyValue.first;
double duij = keyValue.second;
sum += duij * vectorc->at(j);
}
@@ -63,13 +63,13 @@ void LDUSpMat::backSubstituteIntoDU()
//"DU is upper triangular with nonzero diagonals."
double sum, duij;
for (int i = 0; i < m; i++)
for (size_t i = 0; i < m; i++)
{
rightHandSideB->at(i) = rightHandSideB->at(i) / matrixD->at(i);
}
answerX = std::make_shared<FullColumn<double>>(m);
answerX->at(n - 1) = rightHandSideB->at(m - 1);
for (int i = n - 2; i >= 0; i--)
for (int i = n - 2; i >= 0; i--) //Use int because of decrement
{
auto rowi = matrixU->at(i);
sum = 0.0;