代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/163563/10154005
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/424987/10388698
m l1_ls.m
function [x,status,history] = l1_ls(A,varargin)
%
% l1-Regularized Least Squares Problem Solver
%
% l1_ls solves problems of the following form:
%
% minimize ||A*x-y||^2 + lambda*sum|x_i|,
%
%
www.eeworm.com/read/161189/10440073
m blf2.m
%
% [xmin,xmax]=blf2(A,b,c,delta,l,u)
%
% Solves the problem
%
% min/max c'*x
% || Ax-b ||
www.eeworm.com/read/350606/10729128
m forcedosc.m
% This program solves the equation for a forced oscilator
% X_tt + X = f(t), X(0)=X0, X_t(0)=Y0
% through a predictor-corrector methodology. First, the
% equation is rewritten as a first order syst
www.eeworm.com/read/275212/10828458
m lisc.m
function [lam,phi,phip,x,c,kod]=lisc(n,errtol,Lfun,m,Nfun,cinit)
%
% Solves two-point boundary value problems Lu=Nu
% using the Lyapunov-Schmidt method
% Reference:
% Trif, D., The Lyapunov-Schmi
www.eeworm.com/read/441397/7671094
m elimobs.m
function x2 = elimobs(A1,A2,b,C)
%ELIMOBS Eliminates the unknowns x1
% from the observation equations
% [A1 A2] |x1| = b
% |x2|
% and solves the weighted least squ
www.eeworm.com/read/309747/13664988
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/492033/6430517
cpp mdsolver.cpp
#include "mdsolver.h"
#include "global.h"
#include "globmat.h"
#include "loadcase.h"
#include "gmatrix.h"
#include "mechprint.h"
#include "node.h"
#include
/**
function solves problems
www.eeworm.com/read/403838/11508903
m gpsr_bb.m
function [x,x_debias,objective,times,debias_start,mses]= ...
GPSR_BB(y,A,tau,varargin)
%
% GPSR_BB version 5.0, December 4, 2007
%
% This function solves the convex problem
% arg min_x = 0.5*|| y
www.eeworm.com/read/403838/11508909
m l1_ls.m
function [x,status,history] = l1_ls(A,varargin)
%
% l1-Regularized Least Squares Problem Solver
%
% l1_ls solves problems of the following form:
%
% minimize ||A*x-y||^2 + lambda*sum|x_i|,
%
%