代码搜索:sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/163563/10154002
m opf_slvr.m
function code = opf_slvr(alg)
%OPF_SLVR Which OPF solver is used by alg.
% code = opf_slvr(alg) returns a solver code given an algorithm code.
% The codes are:
% 0 - 'constr' from Optimizati
www.eeworm.com/read/358861/10177675
m pare_marq_step.m
function [x, lambda] = pare_marq_step(X, x, lambda);
%PARE_MARQ_STEP Gauss-Newton step with Marquardt
%
% [x, lambda] = pare_marq_step(X, x, lambda);
% makes basic step for this x with marquar
www.eeworm.com/read/200336/10247219
m dsbr_dv.m
function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V)
%DSBR_DV Computes partial derivatives of power flows w.r.t. voltage.
% [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, S
www.eeworm.com/read/353831/10414366
m dibr_dv.m
function [dIf_dVa, dIf_dVm, dIt_dVa, dIt_dVm, If, It] = dIbr_dV(branch, Yf, Yt, V)
%DIBR_DV Computes partial derivatives of branch currents w.r.t. voltage.
% [dIf_dVa, dIf_dVm, dIt_dVa, dIt_dVm, I
www.eeworm.com/read/353831/10414689
m dsbr_dv.m
function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V)
%DSBR_DV Computes partial derivatives of power flows w.r.t. voltage.
% [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, S
www.eeworm.com/read/349479/10825219
m dsbr_dv.m
function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V)
%DSBR_DV Computes partial derivatives of power flows w.r.t. voltage.
% [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, S
www.eeworm.com/read/418304/10954831
m fm_spf.m
function fm_spf
% FM_SPF solve standard power flow by means of the NR method
% and fast decoupled power flow (XB and BX variations)
% with either a single or distributed slack bus model.
%
www.eeworm.com/read/418304/10955749
m fm_cpf.m
function lambda_crit = fm_cpf(fun)
% FM_CPF continuation power flow routines for computing nose curves
% and determining critical points (saddle-node bifurcations)
%
% [LAMBDAC] = FM_CPF
%
%
www.eeworm.com/read/272243/10964597
h dec.h
/* DEC.H - Interface to decoding procedures. */
/* Copyright (c) 2000, 2001 by Radford M. Neal
*
* Permission is granted for anyone to copy, use, or modify this program
* for purposes of researc
www.eeworm.com/read/255778/6933820
m maxcut.m
%%*******************************************************
%% maxcut: MAXCUT problem.
%%
%% (P) min Tr C*X
%% s.t. diag(X) = e;
%%
%% C = -(diag(B*e)-B)/4.
%