代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/367101/9783043
cpp matrixtoeplitzinversiontrench.cpp
//MatrixToeplitzInversionTrench.cpp 特兰持(Trench)法求托伯利兹(Toeplitz)矩阵逆
#include //输入输出流
#include "Matrix.h" //矩阵类及相关函数等的定义
using namespace std; //名字空间
void main() // 定义控制台应用程序的入
www.eeworm.com/read/415746/11055907
m 5-8.m
%例程5－8 利用Bartlett法估计功率谱
% e.g.5-8.m for example5-8;
% to test function psd;
clear all;
% Generate the signal with noise and display
N=1024;
n=0:1/(N-1):1;
f1=0.1;
f2=0.9;
wn=randn(1,N);
www.eeworm.com/read/415746/11055909
m 5-9.m
%例程5－9 利用Welch法估计功率谱
% e.g.5-9.m for example5-9;
% to test function pwelch;
clear all;
% Generate the signal with noise and display
N=1024;
n=0:1/(N-1):1;
f1=0.1;
f2=0.9;
wn=randn(1,N);
www.eeworm.com/read/269921/11061371
htm 2422.htm
下载地址:thunder://QUFodHRwOi8vZG93bjIuOTFlbnQuY29tLzkxJUQzJUU5JUMwJUQ2JUNEJUY4MTExOS8yMDA2MDkvJUNEJUYyJUJDJUZEJUI0JUE5JUQwJUM0JUI1JUM0JUNCJUMwJUI3JUE4Lndtdlpa[万箭穿心的死法][320×240][689K
www.eeworm.com/read/269390/11099572
m guass.m
function guass(A,B)
%高斯列主元消去法
error(nargchk(2,2,nargin));%判断输入矩阵大小
d=max(size(A));%获取系数矩阵的阶
p=max(size(B));
if d==p
dimention=d;
else
fprintf('输入有误，不能构成线性方程组');
end
for q=1:d
www.eeworm.com/read/269390/11099573
m extraction.m
function extraction(A,B)
%平方根法 Cholesky分解，参数说明(系数矩阵A,常数项B)
error(nargchk(2,2,nargin));%判断输入矩阵大小
d=max(size(A));%获取系数矩阵的阶
p=max(size(B));
if d==p
dimention=d;
else
fprintf('输入有误，不能构成线性
www.eeworm.com/read/269231/11104284
java sample5_9.java
public class Sample5_9
{
public static void main(String[] args)
{
//通过省略语法的枚举法创建了二维数组对象，并将引用d指向他
int[][] d={
{1,2,3,4,5,6,7,8},
{9,10,11,12,13,14,15,16},
www.eeworm.com/read/269229/11104476
cpp xuanze2.cpp
//选择排序法(下沉)xuanze2.cpp
#include
#include
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j,k;
for(i=1;i
www.eeworm.com/read/269229/11104525
cpp xuanze5.cpp
//选择排序法xuanze5.cpp
//排序后不改变原数组各元素的值
#include
#include
#include
#include
#define M 10
void sortp(int d[],int *pd[],int b[],int size)
{int i,j,k;
for(i
www.eeworm.com/read/269229/11104530
cpp maopao3.cpp
//冒泡排序法(下沉)maopao3.cpp
#include
#include
#include
#include
#define N 10
void gensort(int b[],int n)
{int i,j;
for(i=1;i