代码搜索:solves

找到约 1,488 项符合「solves」的源代码

代码结果 1,488
www.eeworm.com/read/362246/10010521

m~ gnnls.m~

function [x,fval,stat] = gnnls(H,f,options) % GNNLS Solves Generalized Non-negative Least Squares Problem (GNNLS). % % Synopsis: % [x,fval,stat] = gnnls(H,f) % [x,fval,stat] = gnnls(H,f,options) %
www.eeworm.com/read/362246/10010546

m gnpp.m

function [x,fval,stat] = gnpp(H,f,y,options) % GNPP Solves Generalized Nearest Point (GNPP) problem. % % Synopsis: % [x,fval,stat] = gnpp(H,f) % [x,fval,stat] = gnpp(H,f,options) % % Description: %
www.eeworm.com/read/164554/10103459

m sineg.m

% The script file sineg.m solves the sine-Gordon equation % u_tt-u_xx-sin u on the real line using one of the following % differentiation matrices: (1) Hermite, (2) sinc, or (3) Fourier. % The so
www.eeworm.com/read/200336/10247181

m lpsetup.m

function [x, duals, idx_workc, idx_bindc] = LPsetup(a, f, b, nequs, vlb, vub, idx_workc, mpopt) % LPSETUP solves a LP problem using a callable LP routine % The LP problem is defined as follows: % % mi
www.eeworm.com/read/355063/10297882

f bw.f

program beamwarm c...Solves the Riemann problem for the Euler equations using c...the Beam-Warming second-order upwind method based on any c...of three possible flux vector splittings. c.
www.eeworm.com/read/161505/10400316

m fnnls.m

function [x,w] = fnnls(XtX,Xty,tol) %FNNLS Non-negative least-squares. % % Adapted from NNLS of Mathworks, Inc. % % x = fnnls(XtX,Xty) returns the vector X that solves x = pinv(XtX)*Xty %
www.eeworm.com/read/353831/10414464

m lpsetup.m

function [x, duals, idx_workc, idx_bindc] = LPsetup(a, f, b, nequs, vlb, vub, idx_workc, mpopt) % LPSETUP solves a LP problem using a callable LP routine % The LP problem is defined as follows: % % mi
www.eeworm.com/read/424063/10500978

m qp.m

function [X,lambda,how]=qp(H,f,A,B,vlb,vub,X,neqcstr,verbosity,negdef,normalize) %QP Quadratic programming. % X=QP(H,f,A,b) solves the quadratic programming problem: % % min 0.5*x'Hx +
www.eeworm.com/read/424063/10501640

m qp.m

function [X,lambda,how]=qp(H,f,A,B,vlb,vub,X,neqcstr,verbosity,negdef,normalize) %QP Quadratic programming. % X=QP(H,f,A,b) solves the quadratic programming problem: % % min 0.5*x'Hx +
www.eeworm.com/read/349479/10825094

m lpsetup.m

function [x, duals, idx_workc, idx_bindc] = LPsetup(a, f, b, nequs, vlb, vub, idx_workc, mpopt) % LPSETUP solves a LP problem using a callable LP routine % The LP problem is defined as follows: % % mi