代码搜索：solves

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

代码结果 1,488
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/298590/7950200

m copf.m

function [busout, genout, branchout, f, success, info, et, g, jac] = copf( ... baseMVA, bus, gen, branch, areas, gencost, mpopt) %COPF Solves an AC optimal power flow using CONSTR (Op
·
www.eeworm.com/read/298590/7950410

m dcopf.m

function [buso, geno, brancho, f, success, info, et] = dcopf(baseMVA, ... bus, gen, branch, areas, gencost, mpopt) %DCOPF Solves a DC optimal power flow. % % [bus, gen, branch, f
·
www.eeworm.com/read/197958/7960617

m nlsqold.m

function [x,OPTIONS,CostFunction,JACOB] = nlsqold(FUN,x,OPTIONS,GRADFUN,varargin) %NLSQ Solves non-linear least squares problems. % NLSQ is the core code for solving problems of the form: % min
·
www.eeworm.com/read/196814/8058655

m nlsqold.m

function [x,OPTIONS,CostFunction,JACOB] = nlsqold(FUN,x,OPTIONS,GRADFUN,varargin) %NLSQ Solves non-linear least squares problems. % NLSQ is the core code for solving problems of the form: % min
·
www.eeworm.com/read/333003/12712191

java finaloverridingillusionex.java

// reusing/FinalOverridingIllusionEx.java // TIJ4 Chapter Reusing, Exercise 20, page 269 // Show that the @Override annotation solves the problem in ths section import static net.mindview.util.Prin
·
www.eeworm.com/read/332899/12718002

java finaloverridingillusionex.java

// reusing/FinalOverridingIllusionEx.java // TIJ4 Chapter Reusing, Exercise 20, page 269 // Show that the @Override annotation solves the problem in ths section import static net.mindview.util.Prin
·
www.eeworm.com/read/244945/12829463

m nlsqold.m

function [x,OPTIONS,CostFunction,JACOB] = nlsqold(FUN,x,OPTIONS,GRADFUN,varargin) %NLSQ Solves non-linear least squares problems. % NLSQ is the core code for solving problems of the form: % min
·
www.eeworm.com/read/329331/12960414

m nlsqold.m

function [x,OPTIONS,CostFunction,JACOB] = nlsqold(FUN,x,OPTIONS,GRADFUN,varargin) %NLSQ Solves non-linear least squares problems. % NLSQ is the core code for solving problems of the form: % min
·
www.eeworm.com/read/241396/13147249

m copf.m

function [busout, genout, branchout, f, success, info, et, g, jac] = copf( ... baseMVA, bus, gen, branch, areas, gencost, mpopt) %COPF Solves an AC optimal power flow using CONSTR (Op
·
www.eeworm.com/read/241323/13156493

m kp.m

%> The file solves for eigenvalues of Kronig-Penney type periodic 1D potential. %> It approximates the Hamiltonian by a finite matrix eigenvalue problem. %> Periodic (Bloch) boundary condition
·