代码搜索:Gradient

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

代码结果 2,951
www.eeworm.com/read/216626/4889423

bas_fun triangle.dual.0.bas_fun

3 0 0 0.0000000000 0.0000000000 0 0 0 0 ./triangle.dual.0.bas_fun.so chi_0 gradient_chi_0 0 1 1.0000000000 0.0000000000 0 0 0 0 ./triangle.dual.0.bas_fun.so chi_1 gradient_chi_1 0 2 0.0000000000
www.eeworm.com/read/216626/4889436

bas_fun triangle.1.d.bas_fun

3 2 0 0.1666666667 0.1666666667 1 0 0 0 ./triangle.1.D.bas_fun.so lambda_1 gradient_lambda_1 2 0 0.6666666667 0.1666666667 1 0 0 0 ./triangle.1.D.bas_fun.so lambda_2 gradient_lambda_2 2 0 0.166
www.eeworm.com/read/216626/4889527

bas_fun twin_triangle.1.d.bas_fun

3 2 0 0.1666666667 0.1666666667 1 0 0 0 ./twin_triangle.1.D.bas_fun.so lambda_1 gradient_lambda_1 2 0 0.6666666667 0.1666666667 1 0 0 0 ./twin_triangle.1.D.bas_fun.so lambda_2 gradient_lambda_2 2
www.eeworm.com/read/129875/5968784

h resource.h

//{{NO_DEPENDENCIES}} // Microsoft Developer Studio generated include file. // Used by DIBSectionTestCE.rc // #define IDD_ABOUTBOX 100 #define IDR_MAINFRAME 1
www.eeworm.com/read/419697/10842971

c alg075.c

/* * 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 unknown
www.eeworm.com/read/140700/13066040

txt alg075.txt

> restart; > # 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 equa
www.eeworm.com/read/140700/13066341

txt alg075.txt

> restart; > # 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 equa
www.eeworm.com/read/140698/13066558

c alg075.c

/* * 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 unknown
www.eeworm.com/read/234163/14120294

m grinprodgausnodequad.m

function int=grinprodgausnodequad(g,I); %grinprodgausnodequad Computes the gradient part of the system matrix %in the quadratic basis case. The conductivity is in the linear basis. % Function in
www.eeworm.com/read/378175/2689914

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