代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/158963/10707383
m nnd11fa.m
function nnd11fa(cmd,arg1)
%NND11FA Function approximation demonstration.
%
% This demonstration requires the Neural Network Toolbox.
% First Version, 8-31-95.
%==============================
www.eeworm.com/read/349390/10829939
m disfrft.m
function y=Disfrft(f,a,p)
% Computes discrete fractional Fourier transform
% of order a of vector x
% p (optional) is order of approximation, default N/2
N = length(f); even = ~rem(N,2);
shft = r
www.eeworm.com/read/274975/10841847
m nnd11fa.m
function nnd11fa(cmd,arg1)
%NND11FA Function approximation demonstration.
%
% This demonstration requires the Neural Network Toolbox.
% First Version, 8-31-95.
%==============================
www.eeworm.com/read/419697/10842987
c alg024.c
/*
* SECANT ALGORITHM 2.4
*
* To find a solution to the equation f(x) = 0
* given initial approximations p0 and p1:
*
* INPUT: initial approximation p0, p1; tolerance TOL;
*
www.eeworm.com/read/419563/10860698
txt fig3_37.m .txt
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Figure 3.37
% Illustration of the Parks-McClellan algorithm
% for equiripple approximation
% Lillian Xu 3/24/99
% K. Bell 9/22/00, K. Bell 7/22/01, 9/30/01
www.eeworm.com/read/469123/6977870
m demo_ep_2d.m
% demonstrate the Expectation Propagation approximation on a 2-d
% classification task. 2006-03-29.
if isempty(regexp(path,['gpml' pathsep]))
cd ..; w = pwd; addpath([w, '/gpml']); cd gpml-demo
www.eeworm.com/read/467764/7000992
m que_func.m
function fofx = que_func(x)
% This function computes the value of the Q-function
% listed in Eq.(4.16). It uses the approximation in Eq.s (4.17) and (4.18)
if (x >= 0)
denom = 0.661 * x + 0.339
www.eeworm.com/read/458257/7300323
m que_func.m
function fofx = que_func(x)
% This function computes the value of the Q-function
% listed in Eq.(2.16). It uses the approximation in Eq.s (2.17) and (2.18)
if (x >= 0)
denom = 0.661 * x + 0.339
www.eeworm.com/read/453434/7420746
m fig3_37.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Figure 3.37
% Illustration of the Parks-McClellan algorithm
% for equiripple approximation
% Lillian Xu 3/24/99
% K. Bell 9/22/00, K. Bell 7/22/01, 9/30/01
www.eeworm.com/read/449131/7517926
m nlineq_driver.m
%
% nlineq_driver.m
%
% use bisect.m and newt1d.m to compute an approximation
% of the root of f(x) = cos(x)*cosh(x)+1
%
% Matthias Heinkenschloss
% Department of Computational and Applied Math