代码搜索：Gradient

找到约 2,951 项符合「Gradient」的源代码

代码结果 2,951
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/161705/10384965

m gazbgradeval.m

function [nsol, val] = gaZBGradEval(sol,options) % This evaluation function takes in a potential solution and two options % options(3) is the percent of time to perform the gradient heuristic to the
·
www.eeworm.com/read/161477/10404883

m gazbgradeval.m

function [nsol, val] = gaZBGradEval(sol,options) % This evaluation function takes in a potential solution and two options % options(3) is the percent of time to perform the gradient heuristic to the
·
www.eeworm.com/read/353872/10410963

m gazbgradeval.m

function [nsol, val] = gaZBGradEval(sol,options) % This evaluation function takes in a potential solution and two options % options(3) is the percent of time to perform the gradient heuristic to the
·
www.eeworm.com/read/424747/10418184

m gazbgradeval.m

function [nsol, val] = gaZBGradEval(sol,options) % This evaluation function takes in a potential solution and two options % options(3) is the percent of time to perform the gradient heuristic to the
·
www.eeworm.com/read/161189/10440104

m cg.m

% % xstar=cg(func,delf,x0,tol,maxiter) % % Use Fletcher-Reeves conjugate gradient method to minimize a function f(x). % % func name of the function f(x) % delf name of the gradie
·
www.eeworm.com/read/279380/10442826

m invmainn.m

function [xc,d,MTX,para] = InvMainN(MTX,para,x0) % [xc,d,MTX] = InvMainN(MTX,para,x0) % %% Approximate Unconstrained Gauss-Newton with Armijo rule line search % % Input: MTX = Structure of glob
·
www.eeworm.com/read/424102/10492169

m gazbgradeval.m

function [nsol, val] = gaZBGradEval(sol,options) % This evaluation function takes in a potential solution and two options % options(3) is the percent of time to perform the gradient heuristic to the
·
www.eeworm.com/read/424063/10501605

m cubici2.m

function [stepmin]=cubici2(graddold,matl,matx) %CUBICI2 Cubicly interpolates 3 points and 1 gradient. % % This function uses cubic interpolation and % the values of 3 points and one gradient.
·
www.eeworm.com/read/276024/10773186

m gvf.m

function [u,v] = GVF(f, mu, ITER) %GVF Compute gradient vector flow. % [u,v] = GVF(f, mu, ITER) computes the % GVF of an edge map f. mu is the GVF regularization coefficient % and ITER is the n
·
www.eeworm.com/read/420674/10782219

inf tron.inf

Problem DEPT1 Number of variables 10000 Number of coloring groups 9 Average number of nonzeros in the strictly lower triangula
·