一種基于二維鏈表的稀疏矩陣模半板類設計
A template Class of sparse MATRIX.
Key technology: bin,2-m linked MATRIX.
constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor.
Basic operator: 1. addition(sub) of two MATRIX
2. inverse of a MATRIX.
3. multiply of two MATRIX.
etc.
Computes estimates for the number of forests of a graph, input as a 0-1 incidence MATRIX. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the MATRIX is symmetric with 0 diagonal, but uses only the upper triangular part.
Computes the hafnian of a nonnegative integer MATRIX. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then run by the command "wmatch".
computes the eigenvalues of a symmetric tridiagonal
* MATRIX T. The user may ask for all eigenvalues, all eigenvalues
in the half-open interval (VL, VU], or the IL-th through IU-th eigenvalues.
THIS M-FILE USES THE TRANFER MATRIX METHOD TO EVALUATE THE COUPLED-MODE
％EQUATIONS. THE REFLECTION SPECTRUM OF THE GRATING AND THE TRANSMISSION
％SPECTRUM, DELAY AND DISPERSION OF THE FABRY-PEROT FILTER ARE SIMULATED
