代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/427233/8959600
m wmatch.m
%wmatch.m
%This program solves the maximum-weight matching problem.
n=input('Enter the number of the verties of |T|=|S|=n=')
W=input('Enter the matrix of the graph:[W(1,1),..,W(1,n);..;W(n,1),..,
www.eeworm.com/read/179809/9336014
f lf.f
program lf
c...Solves the Riemann problem for the Euler equations using
c...the Lax-Friedrichs method.
c...TSTEP = 1 Fixed time step
c...TSTEP = 2 Fixed CFL number
c...Numbe
www.eeworm.com/read/178378/9404820
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Subtyping solves the problem
#include
www.eeworm.com/read/355063/10297871
f lf.f
program lf
c...Solves the Riemann problem for the Euler equations using
c...the Lax-Friedrichs method.
c...TSTEP = 1 Fixed time step
c...TSTEP = 2 Fixed CFL number
c...Numbe
www.eeworm.com/read/159921/10588555
m gganders2.m
function [alpha,theta,solution,minr,t,maxerr]=...
gganders2(MI,SG,J,tmax,stopCond,t,alpha,theta)
% GGANDERS2 solves Generalized Anderson's task, generalized gradient.
% [alpha,theta,solution,minr,t
www.eeworm.com/read/421949/10677249
m gganders2.m
function [alpha,theta,solution,minr,t,maxerr]=...
gganders2(MI,SG,J,tmax,stopCond,t,alpha,theta)
% GGANDERS2 solves Generalized Anderson's task, generalized gradient.
% [alpha,theta,solution,minr,t
www.eeworm.com/read/418695/10935673
m qp.m
function [X,lambda,how]=qp(H,f,A,B,vlb,vub,X,neqcstr,verbosity,negdef,normalize)
%QP Quadratic programming.
% X=QP(H,f,A,b) solves the quadratic programming problem:
%
% min 0.5*x'Hx + f'x
www.eeworm.com/read/272224/7096335
m vtb4.m
function vtb4
% VTB4
%
% VTB4_1 Natural frequencies and eigenvectors for an undamped
% system.
% VTB4_2 Free response of an undamped system.
% VTB4_3 solves for the natural frequencies, dampin
www.eeworm.com/read/397102/8068594
m qp.m
function [X,lambda,how]=qp(H,f,A,B,vlb,vub,X,neqcstr,verbosity,negdef,normalize)
%QP Quadratic programming.
% X=QP(H,f,A,b) solves the quadratic programming problem:
%
% min 0.5*x'Hx + f'x
www.eeworm.com/read/296909/8072725
m gpcvx.m
function [x,status,lambda,nu,mu] = gpcvx(A,b,szs,varargin)
% [x,status,lambda,nu,mu] = gpcvx(A,b,szs,G,h,l,u,quiet)
%
% solves the geometric program in convex form
%
% minimize lse(y0)
% subject