代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/366144/9828395
tcl test7.tcl
# QMG test 7 - a circle with two elliptic holes and a crack.
# Make an approximation to a circle using 6 Bezier cubic arcs.
set numseg 6
global PI
global interactive
gmset {verts codes} [gm_circ_app
www.eeworm.com/read/366144/9828431
di test1.di
Thu Aug 26 14:52:32 EDT 1999
-----> ## QMG test 1
Thu Aug 26 14:52:32 EDT 1999
-----> ## This is an approximation to the mesh on the cover of Claes
Thu Aug 26 14:52:32 EDT 1999
-----> ## Johnson'
www.eeworm.com/read/349111/10848958
m mgtlsp.m
function [m,dh] = mgtlsp(d,w,p)
% MGTLSP - Global Total Least Squares misfit computation.
% [M,DH] = MGTLSP(D,W,P) gives the GTLS misfit M and the GTLS
% approximation DH of the data D by the model im
www.eeworm.com/read/349111/10848964
m mgtlsr.m
function [m,dh] = mgtlsr(d,w,r)
% MGTLSR - Global Total Least Squares misfit computation.
% [M,DH] = MGTLSR(D,W,R) gives the GTLS misfit M and the GTLS
% approximation DH of the data D by the model ke
www.eeworm.com/read/469123/6977871
m demo_laplace_2d.m
% demonstrate the Laplace approximation on a 2-d classification task.
% 2006-03-23.
if isempty(regexp(path,['gpml' pathsep]))
cd ..; w = pwd; addpath([w, '/gpml']); cd gpml-demo % add code dir t
www.eeworm.com/read/459014/7284158
m optimal_filter.m
function Y = optimal_filter(X,type,freq_min,freq_max,options)
% PURPOSE: computes cyclical component of X using optimal finite sample
% approximation of the ideal filter.
% Given time series X ass
www.eeworm.com/read/245617/12788108
m func_myappcoef2.m
function a = func_Myappcoef2(c,s,varargin)
%APPCOEF2 Extract 2-D approximation coefficients.
% This code is by Jing Tian
if errargn(mfilename,nargin,[3:5],nargout,[0:1]), error('*'), end
rmax =
www.eeworm.com/read/140700/13066037
txt alg083.txt
> restart;
> # FAST FOURIER TRANSFORM ALGORITHM 8.3
> #
> # To compute the coefficients in the discrete approximation
> # for the data (x(J),y(J)), 0
www.eeworm.com/read/140700/13066338
txt alg083.txt
> restart;
> # FAST FOURIER TRANSFORM ALGORITHM 8.3
> #
> # To compute the coefficients in the discrete approximation
> # for the data (x(J),y(J)), 0
www.eeworm.com/read/410134/11301081
m mgtlsp.m
function [m,dh] = mgtlsp(d,w,p)
% MGTLSP - Global Total Least Squares misfit computation.
% [M,DH] = MGTLSP(D,W,P) gives the GTLS misfit M and the GTLS
% approximation DH of the data D by the model im