代码搜索:solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/407519/2262601
py demo.py
# This demo program solves Poisson's equation
#
# - div grad u(x, y) = f(x, y)
#
# on the unit square with homogeneous Dirichlet boundary conditions
# at y = 0, 1 and periodic boundary conditions
www.eeworm.com/read/403190/2314797
svn-base perform_conjugate_gradient.m.svn-base
function [x,err,it] = perform_conjugate_gradient(A,y,options)
% perform_conjugate_gradient - perform conjugate gradient
%
% [x,err,k] = perform_conjugate_gradient(A,y,options);
%
% Solves for
www.eeworm.com/read/368662/2812399
m lpopf.m
function [busout, genout, branchout, f, success, info, et, g, jac] = lpopf( ...
baseMVA, bus, gen, branch, areas, gencost, mpopt)
%LPOPF Solves an AC optimal power flow using succesiv
www.eeworm.com/read/260708/4328892
txt rubuse.txt
The cube solver will generate a sequence of moves that will
solve any given cube (if solvable). See rubdoc1.txt for
notes on the method.
MAIN MENU OPTIONS
Solve - solves three types of cube
www.eeworm.com/read/471460/6894170
m swingrk4.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 (c) 1998 H. Saadat
%
function s
www.eeworm.com/read/415537/11065798
txt 201.txt
ANFOS
ANFO is an acronym for Ammonium Nitrate - Fuel Oil Solution. An ANFO
solves the only other major problem with ammonium nitrate: its tendency to
pick up water vapor from the air.
www.eeworm.com/read/334923/12562174
m lpopf.m
function [busout, genout, branchout, f, success, info, et, g, jac] = lpopf( ...
baseMVA, bus, gen, branch, areas, gencost, mpopt)
%LPOPF Solves an AC optimal power flow using succesiv
www.eeworm.com/read/334779/12574373
cpp prg15_6g.cpp
// File: prg15_6g.cpp
// the program solves the 8-Queens problem. it prompts the user for
// the starting row for the queen in column 0 and calls the recursive
// backtracking function queens() to
www.eeworm.com/read/334779/12574389
cpp prg15_6.cpp
// File: prg15_6.cpp
// the program solves the 8-Queens problem. it prompts the user for
// the starting row for the queen in column 0 and calls the recursive
// backtracking function queens() to d
www.eeworm.com/read/247527/12652662
m pfminbnd.m
function [X,FVAL,EXITFLAG,OUTPUT] = pfminbnd(FUN,initialX,LB,UB,options)
%PFMINBND Finds minimum of a function with bound constraints.
% PFMINBND solves problems of the form:
% min F(X) s