代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/434436/7866361
m jacobitezhengzhieight3.m
clear;
clc;
eps=1e-5;
N=0;
A=[25,-41,10,-6;
-41,68,-17,10;
10,-17,5,-3;
-6,10,-3,2];
[m,n]=size(A);
while (1)
N=N+1;
B=abs(A);
max=B(1,2);
t=1;k=2;
for i=1:m-1
www.eeworm.com/read/434436/7866376
m itermulteight3.m
clear;
clc;
%function iterMult(A,u,KM,eps) %u为初始列向量，KM是最大迭代次数，eps是容许误差。
A=xlsread('data8_3.xls');
eps=1e-5;
KM=50;
N=size(A,1);
u=ones(N,1);
k=0;r1=0;
while k
www.eeworm.com/read/434436/7866397
m jacobitezhengzhieight4.m
clear;
clc;
eps=1e-5;
N=0;
A=[4,-2,7,3,-1,8;
-2,5,1,1,4,7;
7,1,7,2,3,5;
3,1,2,6,5,1;
-1,4,3,5,3,2;
8,7,5,1,2,4];
[m,n]=size(A);
while (1)
N=N+1;
B=abs(A);
max=B(1
www.eeworm.com/read/434436/7866413
m itermulteight4.m
clear;
clc;
%function iterMult(A,u,KM,eps) %u为初始列向量，KM是最大迭代次数，eps是容许误差。
A=xlsread('data8_4.xls');
eps=1e-5;
KM=50;
N=size(A,1);
u=ones(N,1);
k=0;r1=0;
while k
www.eeworm.com/read/434436/7866415
m itermulteight2.m
clear;
clc;
%function iterMult(A,u,KM,eps) %u为初始列向量，KM是最大迭代次数，eps是容许误差。
A=xlsread('data8_2.xls');
eps=1e-5;
KM=50;
N=size(A,1);
u=ones(N,1);
k=0;r1=0;
while k
www.eeworm.com/read/434436/7866422
m youxianyuan2.m
clear
clc
x=0:1:2;
y=0:0.5:2;
k=0;
N1=length(x);
N2=length(y);
eps=1e-5;
S=1/4;
KK=zeros(15);
N=0;
fprintf('选取节点的方案:\n');
for j=1:length(y)
for i=1:length(x)
k=k+1;
www.eeworm.com/read/434436/7866453
m itermulteight1.m
clear;
clc;
%function iterMult(A,u,KM,eps) %u为初始列向量，KM是最大迭代次数，eps是容许误差。
A=xlsread('data8_1.xls');
eps=1e-5;
KM=50;
N=size(A,1);
u=ones(N,1);
k=0;r1=0;
while k
www.eeworm.com/read/399360/7867220
cpp huffman.cpp
/*__________________________________________________________________________________________________________________
__________________________________________________________________________________
www.eeworm.com/read/299178/7881209
m printpf.m
function printpf(baseMVA, bus, gen, branch, f, success, et, fd, mpopt)
%PRINTPF Prints power flow results.
% printpf(baseMVA, bus, gen, branch, f, success, et, fd, mpopt) prints
% powerflow resu
www.eeworm.com/read/299176/7881383
cpp 最小二乘状态估计.cpp
#include "math.h"
#include "stdio.h"
#include "time.h"
/*#defint CLOCKS_PER_SEC 18.2;*/
int KK1,IT3,N2[7],NA[1000],NB[1000],NOB,NOE,NOM,IMAX,IIO[1000],IOI[1000],IIOE[1000],
MHT[1000],IH