代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/379658/9190564
m ssprop.m
function u1 = ssprop(u0,dt,dz,nz,alpha,betap,gamma,maxiter,tol);
% This function solves the nonlinear Schrodinger equation for
% pulse propagation in an optical fiber using the split-step
% Fouri
www.eeworm.com/read/376212/9325127
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/179809/9336024
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/179809/9336045
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/372550/9504022
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/365161/9876644
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/168118/9937179
m levrec.m
function x=levrec(aa,b);
% LEVREC: solve Tx=b using Levinson's recursion
%
% x=levrec(aa,b)
%
% This function solves the matrix equation Tx=b for the vector
% x using Levinson recursion. The sy
www.eeworm.com/read/166306/10024548
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/358694/10181668
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/357616/10205045
m levrec.m
function x=levrec(aa,b);
% LEVREC: solve Tx=b using Levinson's recursion
%
% x=levrec(aa,b)
%
% This function solves the matrix equation Tx=b for the vector
% x using Levinson recursion. The sy