代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/140697/13066766
m alg102.m
% BROYDEN ALGORITHM 10.2
%
% To approximate the solution of the nonlinear system F(X) = 0
% given an initial approximation X.
%
% INPUT: Number n of equations and unknowns; initial
%
www.eeworm.com/read/140697/13066873
m alg075.m
% CONJUGATE GRADIENT ALGORITHM 7.5
%
% To solve Ax = b given the preconditioning matrix C inverse
% and an initial approximation
% x(0):
%
% INPUT: the number of equations and unknowns n; the
www.eeworm.com/read/140697/13066901
m alg104.m
% CONTINUATION METHOD FOR SYSTEMS ALGORITHM 10.1
%
% To approximate the solution of the nonlinear system F(X)=0 given
% an initial approximation X:
%
% INPUT: Number n of equations and unknowns
www.eeworm.com/read/140697/13066932
m alg102.m
% BROYDEN ALGORITHM 10.2
%
% To approximate the solution of the nonlinear system F(X) = 0
% given an initial approximation X.
%
% INPUT: Number n of equations and unknowns; initial
%
www.eeworm.com/read/140697/13067075
m alg075.m
% CONJUGATE GRADIENT ALGORITHM 7.5
%
% To solve Ax = b given the preconditioning matrix C inverse
% and an initial approximation
% x(0):
%
% INPUT: the number of equations and unknowns n; the
www.eeworm.com/read/140697/13067101
m alg104.m
% CONTINUATION METHOD FOR SYSTEMS ALGORITHM 10.4
%
% To approximate the solution of the nonlinear system F(X)=0 given
% an initial approximation X:
%
% INPUT: Number n of equations and unknowns
www.eeworm.com/read/152580/12100924
m framekernelex1.m
%
% Example of SVM approximation wavelet frame kernel
% is compared to Gaussian kernel
%
% The conclusion of this test is that
% both kernels seem to give equivalent results.
%
% 10/12/2000 A
www.eeworm.com/read/217687/14953444
m ecgbeatfitter.m
function varargout = ECGBeatFitter(varargin)
%
% ECGBeatFitter(ECG,Phase,ExpParamName),
% Graphical user interface for ECG approximation with Gaussian kernels.
%
% inputs:
% ECG: a single ECG wa
www.eeworm.com/read/210675/15193562
ma alg075.ma
(* CONJUGATE GRADIENT ALGORITHM 7.5
*
* To solve Ax = b given the preconditioning matrix C inverse
* and an initial approximation x(0)
*
* Input: the number of equations and unknowns n;
www.eeworm.com/read/457216/1599709
m penalty_comp_cvx.m
% Figure 6.2: Penalty function approximation
% Section 6.1.2
% Boyd & Vandenberghe "Convex Optimization"
% Original by Lieven Vandenberghe
% Adapted for CVX Argyris Zymnis - 10/2005
%
% Comparison of