代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/472943/1402614
m seriesmillssolve.m
function t = SeriesMillsSolve(rho)
% t = SeriesMillsSolve(rho)
%
% Solves the equation M(s) = rho
global ztable millstable
% check that nu is in range.
if max(rho(:)) >= 1 | min( rho(:))
www.eeworm.com/read/472943/1402642
m seriesmillssolve.m
function t = SeriesMillsSolve(rho)
% t = SeriesMillsSolve(rho)
%
% Solves the equation M(s) = rho
global ztable millstable
% check that nu is in range.
if max(rho(:)) >= 1 | min( rho(:))
www.eeworm.com/read/472943/1402710
m seriesmillssolve.m
function t = SeriesMillsSolve(rho)
% t = SeriesMillsSolve(rho)
%
% Solves the equation M(s) = rho
global ztable millstable
% check that nu is in range.
if max(rho(:)) >= 1 | min( rho(:))
www.eeworm.com/read/457216/1599714
m ex_5_19.m
% Exercise 5.19c: Markovitz portfolio optimization w/ diversification constraint
% Boyd & Vandenberghe, "Convex Optimization"
% Jo雔le Skaf - 08/29/05
%
% Solves an extension of the classical Markovitz
www.eeworm.com/read/373026/2767650
m ex_5_19.m
% Exercise 5.19c: Markovitz portfolio optimization w/ diversification constraint
% Boyd & Vandenberghe, "Convex Optimization"
% Jo雔le Skaf - 08/29/05
%
% Solves an extension of the classical Markovitz
www.eeworm.com/read/471460/6894098
m swingrk2.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.
%
% Copyright 1998 H. Saadat
%
function swingr
www.eeworm.com/read/193278/8241569
m unimodal.m
function B=unimodal(X,Y,Bold)
% Solves the problem min|Y-XB'| subject to the columns of
% B are unimodal and nonnegative. The algorithm is iterative
% If an estimate of B (Bold) is given only on
www.eeworm.com/read/147096/12585617
m gflineq.m
function [x, vld] = gflineq(a, b, p)
%GFLINEQ Solves linear equations in GF(p).
% X = GFLINEQ(A, B) outputs the solution of linear equation
% A X = B in GF(2), where the elements in A
www.eeworm.com/read/247527/12652555
m patternsearch.m
function [X,FVAL,EXITFLAG,OUTPUT] = patternsearch(FUN,initialX,Aineq,Bineq,Aeq,Beq,LB,UB,options)
%PATTERNSEARCH Finds a linearly constrained minimum of a function.
% PATTERNSEARCH solves proble
www.eeworm.com/read/101557/15827153
m gflineq.m
function [x, vld] = gflineq(a, b, p)
%GFLINEQ Solves linear equations in GF(p).
% X = GFLINEQ(A, B) outputs the solution of linear equation
% A X = B in GF(2), where the elements in A