代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/370619/9591684
m prony.m
%prony法函数逼近
clear all
clc
N=35;
M=N;
t=1/N;
for n=1:N
for m=1:N
cs(n,m)=f((M-m)*t);
end
v(n,1)=-f(M*t);
M=M+1;
end
a=inv(cs)*v;
a=[1
a];
z=roots(conj(a'));
www.eeworm.com/read/368108/9711671
m exm027_1.m
%exm027_1.m
clear;
A=zeros(2,3);
A(:)=1:6; %全元素赋值法
A=A*(1+i) %运用标量与数组乘产生复数矩阵
A_A=A.' %数组转置，即非共轭转置
A_M=A' %矩阵转置，即共轭转置
www.eeworm.com/read/367134/9780745
cpp extremumbrentnonderivative1d.cpp
//ExtremumBrentNonDerivative1D.CPP
//不用导数的布伦特法求一维函数极小值
#include //模板类iostream输入输出流标准头文件
#include "Extremum.h" //极值头文件
using namespace std; //名字空间
void main()
{
double fext
www.eeworm.com/read/367128/9780883
cpp approximationremez.cpp
//ApproximationRemez.cpp
//最佳一致逼近多项式里米兹法
#include //模板类输入输出流标准头文件
#include "FittingApproximation.h" //拟合与逼近头文件
using namespace std; //名字空间
void main(void)
{
valarray
www.eeworm.com/read/367113/9781379
cpp rootnewtonhilldown.cpp
//RootNewtonHillDown.cpp
//牛顿下山法求解代数方程全部根(实根和复根)
#include //输入输出流头文件
#include "NonLinearEquation.h" //非线性方程(组)求解头文件
using namespace std; //名字空间
void main(void)
{
int i, i
www.eeworm.com/read/366854/9795862
m ja.m
function Ja(A,b)
%Jacobi迭代法求方程组
D=diag(diag(A))
n=size(A)
if det(D)==0
error('it is not situed for Jacobi method')
end
I=eye(n)
B=I-inv(D)*A
g=inv(D)*b
Nj=0;
x0=zeros(n,1);
while(Nj
www.eeworm.com/read/415746/11055890
m 5-11.m
%例程5－11 利用基于AR模型的最大熵法估计功率谱
% e.g.5-11.m for example5-11;
% to test function pyulear;
clf;
clear all;
% Generate the signal plus white noise and show
N=1024;
n=0:1/(N-1):1; %Sampling
www.eeworm.com/read/415746/11055902
m 5-10.m
%例程5－10 利用MTM法估计功率谱
% e.g.5-10.m for example5-10.
% to test function pmtm;
clear all;
% Generate the signal with noise and display
N=1024;
n=0:1/(N-1):1; %Sampling frequency N-1
f1=0.1;
www.eeworm.com/read/269921/11064269
htm 3465.htm
下载地址:thunder://QUFodHRwOi8vd3d3LmR2ZHNwcmluZy5jb20vVHJhaWxlcnMvMjAwNjA3MDMvb25seV9odW1hbl9oNjQwdy5yYXJaWg==[毛脚女婿 Only Human[法：Seres queridos]][][18.6M][RAR][—]