代码搜索:线性分析
找到约 10,000 项符合「线性分析」的源代码
代码结果 10,000
www.eeworm.com/read/398046/8007792
txt 解线性规划.txt
function [x,fval,exitflag,output,lambda]=linprog(f,A,B,Aeq,Beq,lb,ub,x0,options)
%x=linprog(f, A, b)求解线性规划
% min z = f'x, Ax ≤ b;
%x=linprog(f, A, b, Aeq, beq)求解线性规划:
% min
www.eeworm.com/read/197077/8032120
txt 线性相关.txt
//判线性相关(正交化)
//传入m个n维向量
#include
#define MAXN 100
#define eps 1e-10
int linear_dependent(int m,int n,double vec[][MAXN]){
double ort[MAXN][MAXN],e;
int i,j,k;
if (m>n)
return
www.eeworm.com/read/397383/8053505
txt 3阶非线性.txt
3
矩阵A:
-2 1 -1 0 0 0
0 -2 0 0 0 0
10 -10 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
矩阵B:
1 0 0 0 0 0
0 -1 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
矩阵△:
0 0
www.eeworm.com/read/295991/8129464
bmp 灰度线性变换.bmp
www.eeworm.com/read/396055/8135260
ppt 线性表补充.ppt
www.eeworm.com/read/332736/12732549
ppt 线性分组码.ppt
www.eeworm.com/read/145241/12743958
ppt 二:线性表.ppt
www.eeworm.com/read/332124/12777372
c 线性顺序存储结构.c
#include
#include
#define MAX 20
#define ELEMTP int
#define v (*p)
struct sequnce
{
ELEMTP elem[MAX];
int len;
};
main()
{
struct sequnce *pz;
int i,y,cord;
v
www.eeworm.com/read/144253/12805518
txt 线性规划习题.txt
单纯形法m*n (m= 3, n=5 )
目标函数C=[2,1,0,0,0]
向量b=[15,24,5]
矩阵A=
[ 0,5,1,0,0
6,2,0,1,0
1,1,0,0,1]
单纯形法m*n (m= 3, n=5 )
目标函数C=[5,4,0,0,0]
向量b=[6,4,15]
矩阵A=
[ 1,2,1,0,0
2,-1,0,1,0
5,3,0,
www.eeworm.com/read/243633/12930753
c 线性顺序存储结构.c
#include
#include
#define MAX 20
#define ELEMTP int
#define v (*p)
struct sequnce
{
ELEMTP elem[MAX];
int len;
};
main()
{
struct sequnce *pz;
int i,y,cord;
v