代码搜索:solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/156956/11750179
m opf.m
function [buso, gen, branch, f, success, info, et, g, jac] = opf(baseMVA, bus,...
gen, branch, areas, gencost, Au, lbu, ubu, mpopt)
%OPF Solves an optimal power flow.
%
% For an AC OPF, i
www.eeworm.com/read/156908/11753017
c hilbert.c
/*
* Solve set of linear equations involving
* a Hilbert matrix
* i.e. solves Hx=b, where b is the vector [1,1,1....1]
*
* Copyright (c) 1988-1997 Shamus Software Ltd.
*/
#include
www.eeworm.com/read/259727/11770545
m opf.m
function [buso, gen, branch, f, success, info, et, g, jac, xr, pimul] = ...
opf(baseMVA, bus, gen, branch, areas, gencost, Au, lbu, ubu, mpopt, ...
N, fparm, H, Cw)
%OPF Solves an optimal
www.eeworm.com/read/154843/11923409
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/153044/12064489
m fpt.m
function u = fpt(p, doInverse, dx, dy)
% fpt -- Fast Poisson transform.
% fpt(p) solves laplacian(u) = p, for matrix u,
% assuming periodic boundary conditions.
% fpt(p, doInverse) performs the i
www.eeworm.com/read/152916/12074461
f lw.f
program lw
c...Solves the Riemann problem for the Euler equations using
c...the MacCormack or Richtmyer methods.
c...METHOD = 1 MacCormack
c...METHOD = 2 Richtmyer
c...TSTEP = 1
www.eeworm.com/read/152916/12074475
f godunov.f
program godunov
c...Solves the Riemann problem for the Euler equations using Godunov's
c...first-order upwind method
c...Number of grid points.
parameter(N = 50)
real*8 gam
www.eeworm.com/read/150238/12302979
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/337307/12377506
m lipsol.m
function [xsol,fval,lambda,exitflag,output] = lipsol(f,Aineq,bineq,Aeq,beq,lb,ub,options,computeLambda)
%LIPSOL Linear programming Interior-Point SOLver.
% X = LIPSOL(f,A,b) will solves the Linea
www.eeworm.com/read/336521/12439468
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu