代码搜索：solving
找到约 630 项符合「solving」的源代码
代码结果 630
www.eeworm.com/read/233248/14161555
m honeyte.m
% this program is designed for solving the two dimensional photonic structure
% we are using the parameters from one of the paper
%%Honeycomb structure
clear
warning off
%epsa=11.4;
epsa=1;
eps
www.eeworm.com/read/233248/14161556
m honeytm.m
% this program is designed for solving the two dimensional photonic structure
% we are using the parameters from one of the paper
%%Honeycomb structure
clear
warning off
epsa=11.4;
epsb=1;
%eps
www.eeworm.com/read/128468/14295623
m contents.m
% Linear discriminant function.
%
% Included algorithms:
% (dir) anderson - Algorithms solving Generalized Anderson's task.
% (dir) finite - Algorithms separating finite point sets by a hyperp
www.eeworm.com/read/124283/14579539
texi linalg.texi
@cindex linear algebra
@cindex solution of linear systems, Ax=b
@cindex matrix factorization
@cindex factorization of matrices
This chapter describes functions for solving linear systems. The
librar
www.eeworm.com/read/212047/15167015
texi linalg.texi
@cindex linear algebra
@cindex solution of linear systems, Ax=b
@cindex matrix factorization
@cindex factorization of matrices
This chapter describes functions for solving linear systems. The
librar
www.eeworm.com/read/457216/1599678
m cher.m
function prob = cher( A, b, Sigma );
% Computes Chernoff upper bounds on probability
%
% Computes a bound on the probability that a Gaussian random vector
% N(0,Sigma) satisfies A x
www.eeworm.com/read/167728/5453207
texi linalg.texi
@cindex linear algebra
@cindex solution of linear systems, Ax=b
@cindex matrix factorization
@cindex factorization of matrices
This chapter describes functions for solving linear systems. The
librar
www.eeworm.com/read/430506/1929528
m contents.m
% Linear discriminant function.
%
% Included algorithms:
% (dir) anderson - Algorithms solving Generalized Anderson's task.
% (dir) finite - Algorithms separating finite point sets by a hyperp
www.eeworm.com/read/373460/2761962
m contents.m
% Linear discriminant function.
%
% Included algorithms:
% (dir) anderson - Algorithms solving Generalized Anderson's task.
% (dir) finite - Algorithms separating finite point sets by a hyperp
www.eeworm.com/read/373026/2767616
m cher.m
function prob = cher( A, b, Sigma );
% Computes Chernoff upper bounds on probability
%
% Computes a bound on the probability that a Gaussian random vector
% N(0,Sigma) satisfies A x