代码搜索:recursive

找到约 2,177 项符合「recursive」的源代码

代码结果 2,177
www.eeworm.com/read/147682/5728096

m aspteqerr.m

% [u,w,y,e,Px,Pd]=aspteqerr(N,M,u,w,y,x,d,mu,Px,Pd) % % Performs filtering and coefficient update using the % Equation Error Adaptive Recursive Filter % algorithm. The filter transfer
www.eeworm.com/read/147682/5728139

m asptftrls.m

% [ff,bb,k,cf,b,g,w]=asptftrls(ff,bb,k,cf,b,g,w,a,x,d) % % Performs filtering and coefficient update using the % Fast Transversal Recursive Least Squares (FTRLS) algorithm, % also known
www.eeworm.com/read/378682/6287688

m rsc_encode.m

function y = rsc_encode(g, x, terminated) % Copyright Nov. 1998 Yufei Wu % MPRG lab, Virginia Tech. % for academic use only % encodes a block of data x (0/1)with a recursive systematic % convolutiona
www.eeworm.com/read/363748/6288711

m rsc_encode.m

function y = rsc_encode(g, x, terminated) % Copyright Nov. 1998 Yufei Wu % MPRG lab, Virginia Tech. % for academic use only % encodes a block of data x (0/1)with a recursive systematic % convolutiona
www.eeworm.com/read/491236/6437810

m threshold.m

function [pfa, vt] = threshold (nfa, np) % This function calculates the threshold value from nfa and np. % The newton-Raphson recursive formula is used (Eq.s (2-63) through (2-66)) % This function
www.eeworm.com/read/489524/6472643

m threshold.m

function [pfa, vt] = threshold (nfa, np) % This function calculates the threshold value from nfa and np. % The newton-Raphson recursive formula is used (Eq.s (2-63) through (2-66)) % This function
www.eeworm.com/read/477110/6747849

m rne_dh.m

%RNE_DH Compute inverse dynamics via recursive Newton-Euler formulation % % TAU = RNE(ROBOT, Q, QD, QDD) % TAU = RNE(ROBOT, [Q QD QDD]) % % Returns the joint torque required to achieve the specified j
www.eeworm.com/read/476406/6761040

f90 ex0831.f90

program ex0831 implicit none integer :: n write(*,*) 'N=' read(*,*) n write(*, "(I2,'! = ',I8)" ) n, fact(n) stop contains recursive integer function fact(n) result(ans)
www.eeworm.com/read/476406/6761082

f90 ex0829.f90

program ex0829 implicit none integer :: n integer, external :: fact write(*,*) 'N=' read(*,*) n write(*, "(I2,'! = ',I8)" ) n, fact(n) stop end recursive integer function fac
www.eeworm.com/read/409260/11339008

f90 ex0831.f90

program ex0831 implicit none integer :: n write(*,*) 'N=' read(*,*) n write(*, "(I2,'! = ',I8)" ) n, fact(n) stop contains recursive integer function fact(n) result(ans)