代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/263879/11338182
m trust.m
function [s,val,posdef,count,lambda] = trust(g,H,delta)
%TRUST Exact soln of trust region problem
%
% [s,val,posdef,count,lambda] = TRUST(g,H,delta) Solves the trust region
% problem: min{g^Ts + 1
www.eeworm.com/read/403838/11508904
m ist.m
function [x,x_debias,objective,times,debias_start,mses]= ...
IST(y,A,tau,varargin)
% This function solves the convex problem
% arg min_theta = 0.5*|| y - A x ||_2^2 + tau ||x||_1
% using t
www.eeworm.com/read/403838/11508905
m gpsr_basic.m
function [x,x_debias,objective,times,debias_start,mses]= ...
GPSR_Basic(y,A,tau,varargin)
%
% GPSR_Basic version 5.0, December 4, 2007
%
% This function solves the convex problem
% arg min_x =
www.eeworm.com/read/403014/11523646
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Subtyping solves the problem
#in
www.eeworm.com/read/259220/11814305
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Subtyping solves the problem
#in
www.eeworm.com/read/258191/11878450
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Subtyping solves the problem
#in
www.eeworm.com/read/153678/12012836
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Subtyping solves the problem
www.eeworm.com/read/150760/12266262
m gnnls.m
function [x,fval,stat] = gnnls(H,f,options)
% GNNLS Solves Generalized Non-negative Least Squares (GNNLS) problem.
%
% Synopsis:
% [x,fval,stat] = gnnls(H,f)
% [x,fval,stat] = gnnls(H,f,options)
%
www.eeworm.com/read/251835/12317427
m dparam.m
function [z,c,qdat] = dparam(w,beta,z0,options);
%DPARAM Schwarz-Christoffel disk parameter problem.
% [Z,C,QDAT] = DPARAM(W,BETA) solves the Schwarz-Christoffel mapping
% parameter problem wit
www.eeworm.com/read/251835/12317660
m rsparam.m
function [z,zb,c,qdat] = rsparam(w,beta,branch,z0,options);
%RSPARAM Schwarz-Christoffel Riemann surface parameter problem.
% [Z,C,QDAT] = RSPARAM(W,BETA) solves the Schwarz-Christoffel mapping