0
調用樹： populateMatrix（_係數，bMatrix，行的cols）; solveMatrix（coeff，bMatrix，cols + 1）;運行時檢查失敗＃2 - 圍繞bMatix堆棧被損壞
void solveMatrix(float aMatrix[][DEFCOLS+1],float bMatrix[DEFCOLS+1], size_t cols){
std::cout << "\nInside solveMatrix...: " << endl;
size_t N2 = cols;
std::cout << "\N2 is...: " << N2 << endl;
for(size_t p=0; p<N2; p++){
//std::cout << "\nInside 1st for loop...: " << endl;
// find pivot row and swap
int max = p;
for(size_t i=p+1; i<N2; i++){
//std::cout << "\nInside 2nd for loop...: " << endl;
if (abs(aMatrix[i][p]) > abs(aMatrix[max][p])){
max = i;
}
}
//std::cout << "\nJust b4 all the swapping...: " << endl;
float temp[] = { *aMatrix[p] };
*aMatrix[p] = *aMatrix[max];
*aMatrix[max] = *temp;
float t = bMatrix[p];
bMatrix[p] = bMatrix[max];
bMatrix[max] = t;
//std::cout << "\nDone all the swapping...: " << endl;
if (abs(aMatrix[p][p]) <= MINISCULE) {
std::cout << "***** Error matrix value too small. Matrix is singular" << endl;
return;
}
// Pivot /in A and b
for(size_t i=p+1; i<N2; i++){
float alpha = aMatrix[i][p]/aMatrix[p][p];
bMatrix[i] = alpha * bMatrix[p];
for(size_t j=p; j<N2; j++){
aMatrix[i][j] -= alpha * aMatrix[p][j];
}
}
std::cout << "\nAbout to do the back subst..: " << endl;
// back subst.
std::vector<float> outMatrix(N2, 0.0);
int i =0;
for(i=N2-1; i>=0; i--){
float sum = 0.0;
int j=0;
for(j=i+1; j<N2; j++){
sum += aMatrix[i][j] * outMatrix[j];
}
if (aMatrix[i][i] > 0){
outMatrix[i] = (bMatrix[i] - sum)/aMatrix[i][i];
}else {
outMatrix[i] = 0.0;
}
}
int g = 0;
std::cout << "\nSolution: " << endl;
for (;g < N2-1; g++) {
cout << outMatrix[g] << " ";
}
cout << endl;
return;
}
} //結束solveMatrix（）
這高斯消去具有部分樞轉的實施方式。應用程序 運行並給出結果 - 不正確的重試，但在返回後，我得到下面的錯誤。
只要它返回到通話頂部，我就會得到： 運行時檢查失敗＃2 - bMatrix周圍的堆棧已損壞！
我已經看過這個永遠不能明白爲什麼是這種情況。 請幫忙。謝謝。