代码搜索：tridiagonal
找到约 218 项符合「tridiagonal」的源代码
代码结果 218
www.eeworm.com/read/310212/13654781
c tridieig.c
/* $Revision: 1.4 $ */
#include
#include "mex.h"
/* function x = tridieig(c,b,m1,m2,eps1);
* TRIDIEIG Find a few eigenvalues of a tridiagonal matrix.
* LAMBDA = TRIDIEIG(D,E,M1,M
www.eeworm.com/read/154209/11983528
c tridieig.c
/* $Revision: 1.4 $ */
#include
#include "mex.h"
/* function x = tridieig(c,b,m1,m2,eps1);
* TRIDIEIG Find a few eigenvalues of a tridiagonal matrix.
* LAMBDA = TRIDIEIG(D,E,M1,M
www.eeworm.com/read/386253/8759869
m alg067.m
% CROUT FACTORIZATION FOR TRIDIAGONAL LINEAR SYSTEMS ALGORITHM 6.7
%
% To solve the n x n linear system
%
% E1: A(1,1) X(1) + A(1,2) X(2) = A(1,n+1)
% E2: A(2,1) X(1) + A(2,2)
www.eeworm.com/read/386253/8760072
m alg067.m
% CROUT FACTORIZATION FOR TRIDIAGONAL LINEAR SYSTEMS ALGORITHM 6.7
%
% To solve the n x n linear system
%
% E1: A(1,1) X(1) + A(1,2) X(2) = A(1,n+1)
% E2: A(2,1) X(1) + A(2,2)
www.eeworm.com/read/140697/13066775
m alg067.m
% CROUT FACTORIZATION FOR TRIDIAGONAL LINEAR SYSTEMS ALGORITHM 6.7
%
% To solve the n x n linear system
%
% E1: A(1,1) X(1) + A(1,2) X(2) = A(1,n+1)
% E2: A(2,1) X(1) + A(2,2)
www.eeworm.com/read/140697/13066950
m alg067.m
% CROUT FACTORIZATION FOR TRIDIAGONAL LINEAR SYSTEMS ALGORITHM 6.7
%
% To solve the n x n linear system
%
% E1: A(1,1) X(1) + A(1,2) X(2) = A(1,n+1)
% E2: A(2,1) X(1) + A(2,2)
www.eeworm.com/read/310212/13654774
m tridieig.m
function x = tridieig(c,b,m1,m2,eps1);
%TRIDIEIG Find a few eigenvalues of a tridiagonal matrix.
% LAMBDA = TRIDIEIG(D,E,M1,M2). D and E, two vectors of length N,
% define a symmetric, tridia
www.eeworm.com/read/154209/11983514
m tridieig.m
function x = tridieig(c,b,m1,m2,eps1);
%TRIDIEIG Find a few eigenvalues of a tridiagonal matrix.
% LAMBDA = TRIDIEIG(D,E,M1,M2). D and E, two vectors of length N,
% define a symmetric, tridia