代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/457216/1599710
m deadzone.m
% Section 6.1.2: Residual minimization with deadzone penalty
% Boyd & Vandenberghe "Convex Optimization"
% Joelle Skaf - 08/17/05
%
% The penalty function approximation problem has the form:
%
www.eeworm.com/read/457216/1599711
m fig6_15.m
% Figure 6.15: A comparison of stochastic and worst-case robust approximation
% Section 6.4.2
% Boyd & Vandenberghe "Convex Optimization"
% Original by Lieven Vandenberghe
% Adapted for CVX by Joelle
www.eeworm.com/read/204713/5029669
java squareroot.java
package diverse;
/*
* Integer Square Root function
* Contributors include Arne Steinarson for the basic approximation idea, Dann
* Corbit and Mathew Hendry for the first cut at the algorithm, Law
www.eeworm.com/read/198657/5083390
c sizeinbase.c
/* mpn_sizeinbase -- approximation to chars required for an mpn.
THE FUNCTIONS IN THIS FILE ARE FOR INTERNAL USE ONLY. THEY'RE ALMOST
CERTAIN TO BE SUBJECT TO INCOMPATIBLE CHANGES OR DISAPPEAR
www.eeworm.com/read/388600/2549110
tex abs.tex
\begin{abstract}
The familiar hyperbolic approximation of $P$-wave reflection
moveout is exact for homogeneous isotropic or elliptically anisotropic
media above a planar reflector.
%only if the reflec
www.eeworm.com/read/373026/2767645
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
www.eeworm.com/read/373026/2767646
m deadzone.m
% Section 6.1.2: Residual minimization with deadzone penalty
% Boyd & Vandenberghe "Convex Optimization"
% Joelle Skaf - 08/17/05
%
% The penalty function approximation problem has the form:
%
www.eeworm.com/read/373026/2767647
m fig6_15.m
% Figure 6.15: A comparison of stochastic and worst-case robust approximation
% Section 6.4.2
% Boyd & Vandenberghe "Convex Optimization"
% Original by Lieven Vandenberghe
% Adapted for CVX by Joelle
www.eeworm.com/read/364151/2908068
svn-base siteinsert.m.svn-base
% Given an LR image and the Delaunay triangulation used in creating
% an HR image from some set of LR images, this function incorporates
% the additional LR image into the approximation, to further
www.eeworm.com/read/367152/9780157
m lans_ppsgtm1.m
% lans_ppsgtm1 - Generative Topographical Mapping approximation for PPS
%
% [pps,Lcomp,Lavg] = lans_ppsgtm1(pps,y,options)
%
% _____OUTPUTS____________________________________________________________