代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/393211/8304450
asv rwg4.asv
%RWG4 Solves MoM equations for the antenna radiation problem
% Uses the mesh file from RWG2, mesh2.mat, and
% the impedance file from RWG3, impedance.mat,
% as inputs.
%
% Also calcula
www.eeworm.com/read/393211/8304721
m rwg4.m
%RWG4 Solves MoM equations for the antenna radiation problem
% Uses the mesh file from RWG2, mesh2.mat, and
% the impedance file from RWG3, impedance.mat,
% as inputs.
%
% Also calcula
www.eeworm.com/read/366897/9793860
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Subtyping solves the problem
#in
www.eeworm.com/read/334860/12568186
m trust.m
function [s,val,posdef,count,lambda] = trust(g,H,delta)
%TRUST Exact soln of trust region problem
%
% [s,val,posdef,count,lambda] = TRUST(g,H,delta) Solves the trust region
% problem: min{g^Ts + 1
www.eeworm.com/read/110993/15520698
cpp fname2.cpp
//: C14:FName2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Subtyping solves the problem
www.eeworm.com/read/432289/8613566
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/431675/8662366
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/386625/8734448
m sor.m
%SOR Successive Over-Relaxation method
%
% [X,RESIDS,ITS]=SOR(A,B,X0,RTOL,PRTOL,MAX_IT,MAX_TIME,MAX_MFLOP)
% solves the system AX = B using the successive over-relaxation
% me
www.eeworm.com/read/386625/8734532
m vmg.m
%VMG Multigrid V-Cycle Solver
%
% [X,RESIDS,ITS]=VMG(A,B,X0,RTOL,PRTOL,MAX_IT,MAX_TIME,MAX_MFLOP)
% solves the system AX = B iteratively using multigrid cycles whose type
% is
www.eeworm.com/read/428849/8835028
m gnpp.m
function [x,fval,stat] = gnpp(H,f,y,options)
% GNPP Solves Generalized Nearest Point (GNPP) problem.
%
% Synopsis:
% [x,fval,stat] = gnpp(H,f,y)
% [x,fval,stat] = gnpp(H,f,y,options)
%
% Descriptio