#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
const int MAXN = 1000;
double a[MAXN][MAXN];
double l[MAXN][MAXN];
double u[MAXN][MAXN];
double b[MAXN];
double x[MAXN];
double y[MAXN];
int main()
{
int n;
double maxs;
freopen("in.txt","r",stdin);
while(cin >> n){
for(int i = 0;i<n;i++)cin >> b[i];
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
cin >> a[i][j];
}
}
//memset(l,0,sizeof(l));
//memset(u,0,sizeof(u));
for(int i = 0;i<n;i++)l[i][i] = 1;
for(int k = 0;k<n;k++){///求第k行u和第k列l
for(int j = k;j<n;j++){
u[k][j] = a[k][j];
for(int m = 0;m<k;m++){
u[k][j]-=l[k][m]*u[m][j];
数值分析2.2 直接三角分解方法
最新推荐文章于 2022-09-23 22:52:20 发布