代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/135738/13905507
opt 矩阵乘法.opt
www.eeworm.com/read/134035/14011926
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/133496/14038726
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/200797/15424790
txt 矩阵类.txt
#ifndef _MATRIX_H_
#define _MATRIX_H_
/*
File Name: Matrix.h
Lib Name: JGMath2D.lib
Description: For the 2D translation
Created Author:Bookworm_zju@zjuem.edu.cn
Created Data: 04/22/02
*
www.eeworm.com/read/111574/15509842
txt 矩阵运算.txt
// 稀疏矩阵.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include
#include
#define OVERFLOW -1
#
www.eeworm.com/read/111277/15515814
txt 逆矩阵.txt
Matrix& Matrix::getInverse()
{
if(len==0) throw Excp(BOp);
double* pm;
int row,col;
if((pm=new double [len*l
www.eeworm.com/read/111276/15515815
cpp 逆矩阵.cpp
//全主元矩阵求逆程序
# include
# include
# include
double **a;
int row;
void divn(double **a,int row )
{
int* is;
int *js;
js=new int[row];
is=new i
www.eeworm.com/read/109219/15561743
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/107239/15611481
doc 矩阵相乘.doc
www.eeworm.com/read/107030/15614491
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[