代码搜索：gradient
找到约 2,951 项符合「gradient」的源代码
代码结果 2,951
www.eeworm.com/read/427216/8965793
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/185152/9054836
m dsobjg.m
function g=dsobjg(x)
% Usage:
% g=dsobjg(x)
% Calculates the gradient of the objective function
% at a point for Shell Dual Problem
global A B C D E
x=x(:);g=x;
g(1:5)=6*D.*x(1:5).^2
www.eeworm.com/read/185152/9054964
m dualshg.m
function g=dualshg(x)
% Usage:
% g=dualshg(x)
% Returns the gradient of the exact penalty function
% at a point for Shell Dual problem
global A B C D E Penalty_Coeff
if size(x,2)>1, x=
www.eeworm.com/read/185152/9054970
m dscntg.m
function g=dscntg(x)
% Usage:
% g=dscntg(x)
% Calculates the gradient of the constraint with the maximal
% residual at a point for Shell Dual Problem
global A B C D E
x=x(:); g=zeros(si
www.eeworm.com/read/282846/9056120
m scg.m
function [x, options, errlog, pointlog, scalelog] = scg(f, x, options, gradf, varargin)
%SCG Scaled conjugate gradient optimization.
%
% Description
% [X, OPTIONS] = SCG(F, X, OPTIONS, GRADF) uses a s
www.eeworm.com/read/380443/9149502
c dxdygrad.c
/*
* dxdygrad.c -- functions for computing phase derivatives in arrays
*/
#include
#include
#include "file.h"
#include "pi.h"
#include "grad.h"
#include "dxdygrad.h"
/*
www.eeworm.com/read/180495/9304986
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/375871/9346389
ctl command.ctl
VERSION 5.00
Begin VB.UserControl CommandButton
AutoRedraw = -1 'True
ClientHeight = 3600
ClientLeft = 0
ClientTop = 0
ClientWidth = 4800
Sc
www.eeworm.com/read/375212/9369014
m grad1.m
function df=grad(x)
%GRAD1 Calcualtes Jocobian of objective function for training NNPLS
% Routine to calculate the Jacobian of fun1 for optimization with leastsq.
% grad1 here is different from gra
www.eeworm.com/read/375212/9369062
m inner1.m
function [x,f0]=inner1(n,b,t,u,weights,plots)
%INNER1 Fits one dimensional nonlinear inner relationsip to score data
% Routine to fit a one dimensional nonlinear inner relationship to score data
%