代码搜索：Dissection
找到约 18 项符合「Dissection」的源代码
代码结果 18
www.eeworm.com/read/189135/8489548
m nested_dissection.m
function perm=nested_dissection(A)
% A is the adjacency matrix which must be renumbered
% A is sparse and symmetric
% The output perm is a permutation array which defines the
% renumbering
% The ne
www.eeworm.com/read/450032/7491706
pdf cpp_by_dissection.pdf
www.eeworm.com/read/412095/11216111
pdf addison wesley - c++ by dissection.pdf
www.eeworm.com/read/157044/11743393
m contents.m
% Mesh Partitioning Toolbox. Distribution version of 8 Feb 2002.
%
% Demonstrations.
% Say "meshdemo" for some examples.
% Also, many of the individual routines can draw pictures of what they d
www.eeworm.com/read/319180/13459270
changes
ILUPACK 2.0
Changes compared with release V1.1
real/complex symmetric indefinite problems as well as complex Hermitian
indefinite systems are supported by special drivers.
As iterative solver the si
www.eeworm.com/read/157044/11743395
m gsnd.m
function p = gsnd(S,minsep,ntries);
% GSND : Geometric spectral nested dissection ordering.
%
% p = gsnd(S,minsep,ntries). Nested dissection ordering of S.
% For a symmetric positive definite matrix
www.eeworm.com/read/157044/11743396
m geond.m
function p = geond(S,Sxy,minsep,ntries);
% GEOND : Geometric nested dissection ordering.
%
% p = geond(S,Sxy,minsep,ntries). Nested dissection ordering of S.
% For a symmetric positive definite matri
www.eeworm.com/read/157044/11743491
m metisnd.m
function p = metisnd(S);
% METISND : Metis nested dissection ordering.
%
% p = metisnd(S): Nested dissection ordering of S.
% For a symmetric positive definite matrix S, this returns
% a nested disse
www.eeworm.com/read/157044/11743390
m specnd.m
function p = specnd(S,minsep);
% SPECND : Spectral nested dissection ordering.
%
% p = specnd(S,minsep). Nested dissection ordering of S.
% For a symmetric positive definite matrix S, this returns
%