代码搜索：solves

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

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

m swingmeu.m

% This program solves the swing equation of a one-machine system % when subjected to a three-phase fault with subsequent clearance % of the fault. Modified Euler method % % Copyright (c) 1998 H. S
·
www.eeworm.com/read/263879/11338148

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/407093/11429536

c sgssvx.c

/*! @file sgssvx.c * \brief Solves the system of linear equations A*X=B or A'*X=B * * * -- SuperLU routine (version 3.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center,
·
www.eeworm.com/read/407093/11429574

c dgssvx.c

/*! @file dgssvx.c * \brief Solves the system of linear equations A*X=B or A'*X=B * * * -- SuperLU routine (version 3.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center,
·
www.eeworm.com/read/407093/11429583

c zgssvx.c

/*! @file zgssvx.c * \brief Solves the system of linear equations A*X=B or A'*X=B * * * -- SuperLU routine (version 3.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center,
·
www.eeworm.com/read/407093/11429605

c cgssvx.c

/*! @file cgssvx.c * \brief Solves the system of linear equations A*X=B or A'*X=B * * * -- SuperLU routine (version 3.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center,
·
www.eeworm.com/read/156956/11750130

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/156956/11750497

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/346392/11751479

m mst_k.m

%MST_k.m %This program solves the Minimum Spanning Tree problem by using Kruskal Algorithm.') n=input('Enter the vertices number of the graph:n= ') W=input('Enter the weight adjacent matrix of the
·
www.eeworm.com/read/259727/11770503

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
·