代码搜索:矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/457536/7324340
pch 矩阵运算.pch
www.eeworm.com/read/457536/7324341
dsp 矩阵运算.dsp
# Microsoft Developer Studio Project File - Name="矩阵运算" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Cons
www.eeworm.com/read/457536/7324342
dsw 矩阵运算.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# 警告: 不能编辑或删除该工作区文件!
###############################################################################
Project: "矩阵运算"=".\矩阵运算.dsp"
www.eeworm.com/read/457536/7324344
opt 矩阵运算.opt
www.eeworm.com/read/457438/7325521
cpp 矩阵相乘.cpp
#include
#include
using namespace std;
template
void matrixm(T *a,T *b,int rows,int cols,int colsb)
{
int sum,l,i,j;
for(l=0;l
www.eeworm.com/read/452642/7436662
dev 矩阵类.dev
[Project]
FileName=矩阵类.dev
Name=矩阵类
UnitCount=3
Type=1
Ver=1
ObjFiles=
Includes=
Libs=
PrivateResource=
ResourceIncludes=
MakeIncludes=
Compiler=
CppCompiler=
Linker=
IsCpp=1
Icon=
Ex
www.eeworm.com/read/452642/7436665
exe 矩阵类.exe
www.eeworm.com/read/450798/7476651
c 逆矩阵.c
#define N 5 /*[注]:修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放,在矩阵s[
www.eeworm.com/read/450798/7476683
c 乘法矩阵.c
#include
void main()
{
int i,j;
int big[8][8];
for (i = 0;i < 8;i++) /*循环嵌套*/
for (j = 0;j < 8;j++)
big[i][j] = i * j; /* 乘法表 */
big[2][6] = 748;
www.eeworm.com/read/450798/7476777
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i