代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/350746/10713350
m thomas.m
function x = thomas(varargin)
% THOMAS Solves a tridiagonal linear system
%
% x = THOMAS(A,d) solves a tridiagonal linear system using the very efficient
% Thomas Algorith. The vector x i
www.eeworm.com/read/350746/10713456
m oldthomas.m
function x = thomas(varargin)
% THOMAS Solves a tridiagonal linear system
%
% x = THOMAS(A,d) solves a tridiagonal linear system using the very efficient
% Thomas Algorith. The vector x i
www.eeworm.com/read/213905/15122661
m thomas.m
function x = thomas(varargin)
% THOMAS Solves a tridiagonal linear system
%
% x = THOMAS(A,d) solves a tridiagonal linear system using the very efficient
% Thomas Algorith. The vector x i
www.eeworm.com/read/379930/9172222
cpp queenchess.cpp
// QueenChess类的定义
#include"queenchess.h"
// 构造函数，将棋盘初始化
QueenChess::QueenChess()
{
solves = 0;
int i = 0;
for (; i < 8; ++i)
chessState[i] = "--------";
}
// 打印成功的棋盘
void QueenCh
www.eeworm.com/read/376216/9324580
cpp queenchess.cpp
// QueenChess类的定义
#include"queenchess.h"
// 构造函数，将棋盘初始化
QueenChess::QueenChess()
{
solves = 0;
int i = 0;
for (; i < 8; ++i)
chessState[i] = "--------";
}
// 打印成功的棋盘
void QueenCh
www.eeworm.com/read/271285/11001144
cpp queenchess.cpp
// QueenChess类的定义
#include"queenchess.h"
// 构造函数，将棋盘初始化
QueenChess::QueenChess()
{
solves = 0;
int i = 0;
for (; i < 8; ++i)
chessState[i] = "--------";
}
// 打印成功的棋盘
void QueenCh
www.eeworm.com/read/325530/13198594
cpp queenchess.cpp
// QueenChess类的定义
#include"queenchess.h"
// 构造函数，将棋盘初始化
QueenChess::QueenChess()
{
solves = 0;
int i = 0;
for (; i < 8; ++i)
chessState[i] = "--------";
}
// 打印成功的棋盘
void QueenCh
www.eeworm.com/read/312163/13617625
m contents.m
% Optimization methods for STPRtoolbox.
%
% gmnp - Solves Generalized Minimal Norm (GMNP) problem.
% gnnls - Solves Generalized Non-negative Least Squares (GNNLS) problem.
% gnpp - S
www.eeworm.com/read/312163/13617649
m~ contents.m~
% Optimization methods for STPRtoolbox.
%
% gmnp - Solves Generalized Minimal Norm (GMNP) problem.
% gnnls - Solves Generalized Non-negative Least Squares (GNNLS) problem.
% gnpp - S
www.eeworm.com/read/155627/11860199
m f2.m
% this function solves the problem of draw out elements from matrix.
function a=f2(s,m)
t=length(s);
j=1;
if t==0|t==1
a=[];
else
for i=1:t
if s(i)~=m
a(j)=s(i);