
数值分析
平林寒山98
这个作者很懒,什么都没留下…
展开
-
Jacobi迭代
#include<stdio.h>#include<math.h>#define N 3void print(double s[N][N]){ for (int i = 0; i <N; i++) { for (int j = 0; j<N; j++) { printf("%lf ",s[i][j]); } printf("\n"); }}void multiply(double g[N][N],double v[N][N])//乘原创 2020-06-18 00:27:36 · 390 阅读 · 0 评论 -
C语言实现Crout分解
PS:3、4公式要同时进行,第4公式的j要从k开始。#include<stdio.h>#define N 4#define col 4//列数#define row 4//行数void print(double a[row][col]) { for (int i = 0; i < row; i++)//找到最大主元,记录行号和列号 { for (int j = 0; j < col; j++) { printf("%f ", a[i][j]); .原创 2020-05-19 01:04:19 · 1222 阅读 · 0 评论 -
差商差值
#include<stdio.h>#include<math.h>#define N 6double fun(double *xi, double *f, double x)//前两个参数为定点,第三个参数为估值点{ double data[N - 1][N - 1] = {0};//差商表 for (int col = 1; col <= N - 1; col++)//初始化差商表 { for (int row = col; row <= N ...原创 2020-05-19 17:49:20 · 921 阅读 · 0 评论 -
Newton迭代,割线法
#include<stdio.h>#include<math.h>double F(double x){ return cos(x) - x;}double F_(double x){ return -1 - sin(x);}double Newton(double x0,double e,int N){ double x; int k = 1; do { if (F_(x0) == 0) break; else x = x.原创 2020-05-19 15:58:38 · 1345 阅读 · 0 评论 -
Seidel迭代法
#include<stdio.h>#include<math.h>#define N 3#define col 3//列数#define row 3//行数void print(double a[row][col]) { for (int i = 0; i < row; i++)//找到最大主元,记录行号和列号 { for (int j = 0; j < col; j++) { printf("%f ", a[i][j]); } .原创 2020-05-19 01:40:27 · 1142 阅读 · 0 评论 -
C语言实现高斯主元素法
#include<stdio.h>#define Col 4//列数#define Row 3//行数void Print(double a[Row][Col]) {//打印a数组 for (int i = 0; i < Row; i++)//找到最大主元,记录行号和列号 { for (int j = 0; j < Col; j++) { print...原创 2020-03-03 00:30:13 · 459 阅读 · 0 评论