代码搜索:solves

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

代码结果 1,488
www.eeworm.com/read/366959/2857645

m gganders2.m

function [alpha,theta,solution,minr,t,maxerr]=... gganders2(MI,SG,J,tmax,stopCond,t,alpha,theta) % GGANDERS2 solves Generalized Anderson's task, generalized gradient. % [alpha,theta,solution,minr,t
www.eeworm.com/read/353473/3085403

cpp queenchess.cpp

// QueenChess类的定义 #include"queenchess.h" // 构造函数,将棋盘初始化 QueenChess::QueenChess() { solves = 0; int i = 0; for (; i < 8; ++i) chessState[i] = "--------"; } // 打印成功的棋盘 void QueenCh
www.eeworm.com/read/266483/4272280

m gganders2.m

function [alpha,theta,solution,minr,t,maxerr]=... gganders2(MI,SG,J,tmax,stopCond,t,alpha,theta) % GGANDERS2 solves Generalized Anderson's task, generalized gradient. % [alpha,theta,solution,minr,t
www.eeworm.com/read/393976/8252682

m vtb4.m

function vtb4 % VTB4 % % VTB4_1 Natural frequencies and eigenvectors for an undamped % system. % VTB4_2 Free response of an undamped system. % VTB4_3 solves for the natural frequencies, dampin
www.eeworm.com/read/293183/8310878

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 + f'x
www.eeworm.com/read/367442/9748253

m gganders2.m

function [alpha,theta,solution,minr,t,maxerr]=... gganders2(MI,SG,J,tmax,stopCond,t,alpha,theta) % GGANDERS2 solves Generalized Anderson's task, generalized gradient. % [alpha,theta,solution,minr,t
www.eeworm.com/read/188426/8541381

m uopf.m

function [best_bus, best_gen, best_branch, best_f, best_success, et] = ... uopf(baseMVA, bus, gen, gencost, branch, Ybus, Yf, Yt, mpopt) %UOPF Solves combined unit commitment / optimal power flow
www.eeworm.com/read/288524/8627139

m newtonpf.m

function [V, converged, i] = newtonpf(Ybus, Sbus, V0, ref, pv, pq, verbose) %NEWTONPF Solves the power flow using a full Newton's method. % [V, converged, i] = newtonpf(Ybus, Sbus, V0, ref, pv,
www.eeworm.com/read/184703/9084955

m cgm_2d2.m

function [u,iter,res] = cgm_2d2(z, alpha, beta, nit, tol) %[u,w,it,res] = cgm_2d(z, alpha, beta, nit, tol, iout); %Solves the unconstrained formulation of TV denoising %z: noisy image,
www.eeworm.com/read/364508/9904928

m gee_its_sweet.m

function x = gee_its_sweet (A, b) % GEE_ITS_SWEET solves Ax=b with just x=A\b; it doesn't get sweeter than this % % Example: % % x = gee_its_sweet (A,b) ; % just does x=A\b, using backslash it