试验内容
利用列主元消去法求解课本P.176第7题
实验原理
列主元消去法基本是在高斯消去法的基础上进行了稍微的排序减小了误差
源代码
#include<iostream>
#include<cmath>
using namespace std;
const int n = 3;
template<class T>
void SWAP(T& a, T& b)
{
T c;
c = a;
a = b;
b = c;
}
void gaussin_L(double a[n][n], double b[n])
{
int i, j, k;
int col, row;
for (k = 0; k < n - 1; k++)
{
double ave = 0;
for (i = k; i < n ; i++)
if (fabs(a[i][k]) > ave)
{
ave = fabs(a[i][k]);
cout << "ave " << ave << endl;
row = i;
col = k;
}
if (a[row][row] == 0)
{
cout << "can't solve" << endl;
return;