代码搜索:方波逆变
找到约 4,865 项符合「方波逆变」的源代码
代码结果 4,865
www.eeworm.com/read/294584/8217772
plg 逆矩阵.plg
Build Log
--------------------Configuration: 逆矩阵 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\ADMINI~1\
www.eeworm.com/read/294584/8217773
dsw 逆矩阵.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# 警告: 不能编辑或删除该工作区文件!
###############################################################################
Project: "逆矩阵"=".\逆矩阵.dsp" -
www.eeworm.com/read/392212/8356956
cpp 求逆.cpp
#include
int gcd(int d,int f)
{
int temp;
while(f!=0)
{
temp=d;
d=f;
f=temp%f;
}
return d;
}
int Euclid(int d, int f)
{
int Q[100],B[100],q1,q2,c1,c2,i=1;
B[0]=0;
www.eeworm.com/read/333945/12651529
c 逆阵.c
#include "stdio.h"
float z[4][4],*y=z; /*定义一个全局二维数组用来存放N-1阶余子式,因为A的伴随矩阵除以|A|时会产生小数,因此定义成float而非int*/
int js(int *p,int n) /*计算行列式的函数*/
{int k=0,i,s2=0,s1=0,j,s,t;
printf("\n"
www.eeworm.com/read/333945/12651535
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/134035/14011922
c 逆阵.c
#include "stdio.h"
float z[4][4],*y=z; /*定义一个全局二维数组用来存放N-1阶余子式,因为A的伴随矩阵除以|A|时会产生小数,因此定义成float而非int*/
int js(int *p,int n) /*计算行列式的函数*/
{int k=0,i,s2=0,s1=0,j,s,t;
printf("\n"
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/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/15561742
c 逆阵.c
#include "stdio.h"
float z[4][4],*y=z; /*定义一个全局二维数组用来存放N-1阶余子式,因为A的伴随矩阵除以|A|时会产生小数,因此定义成float而非int*/
int js(int *p,int n) /*计算行列式的函数*/
{int k=0,i,s2=0,s1=0,j,s,t;
printf("\n"