代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/257911/11906965
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/343743/11930997
m rbf_rr_2.m
function [C, R, w, info, conf] = rbf_rr_2(X, y, conf)
%
% Ridge regression using radial basis functions.
%
% Solves a regression problem with inputs X and outputs y using ridge
% regression (weight de
www.eeworm.com/read/153018/12066840
m fastnnls.m
function [x,w] = fastnnls(XtX,Xty,tol)
%NNLS Non-negative least-squares.
% b = fastnnls(XtX,Xty) returns the vector b that solves X*b = y
% in a least squares sense, subject to b >= 0, given the in
www.eeworm.com/read/152916/12074458
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/253870/12179490
m gre.m
function [P,D1,D2]=gre(A0,A1,B,delay,M,N)
%GRE solves the generalized Ricatti equations corresponding to
% the linear quadratic regulator problem for systems with delays.
% For the system x'= A
www.eeworm.com/read/150760/12266234
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/150760/12266243
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/150760/12266265
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/251835/12317291
m deparam.m
function [z,c,qdat] = deparam(w,beta,z0,options)
%DEPARAM Schwarz-Christoffel exterior parameter problem.
% [Z,C,QDAT] = DEPARAM(W,BETA) solves the Schwarz-Christoffel mapping
% parameter pro
www.eeworm.com/read/130982/14164463
m forward_solver.m
function [V] = forward_solver(vtx,E,I,tol,pp,V);
%function [V] = forward_solver(vtx,E,I,tol,pp,V);
%
%This function solves the forward problem using the Cholesky or LU method or
%conjugate gradie