The following Matlab code converts a Matrix into it a diagonal and off-diagonal component and performs up to 100 iterations of the Jacobi method or until 蔚step < 1e-5
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.
平均因子分解法，適用于正定矩陣First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangular (that is, it has all zeros below the diagonal).
It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
2． Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve the following tri-diagonal system
for n=10 and 100
This function obtains a unitary matrix Q such that: d=diag(Q *diag(lmd)*Q).
In other words, it gives a way to generate a matrix with given eigenvalues and diagonal elements.
By Daniel Perez Palomar (last revision: May 10, 2004).
Feel free to distribute this file as it is (without including any modifications).
迷宮算法（maze）
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
Computes all eigenvalues and eigenvectors of a real symmetric matrix a,
! which is of size n by n, stored in a physical np by np array.
! On output, elements of a above the diagonal are destroyed.
! d returns the eigenvalues of a in its first n elements.
! v is a matrix with the same logical and physical dimensions as a,
! whose columns contain, on output, the normalized eigenvectors of a.
! nrot returns the number of Jacobi rotations that were required.
! Please notice that the eigenvalues are not ordered on output.
! If the sorting is desired, the addintioal routine "eigsrt"
! can be invoked to reorder the output of jacobi.
DescriptionThe IMX385LQR-C is a diagonal 8.35 mm (Type 1/2) CMOS active pixel type solid-state image sensor with a squarepixel array and 2.13 M effective pixels. This chip operates with analog 3.3 V, digital 1.2 V, and interface 1.8 V triplepower supply, and has low power consumption. High sensitivity, low dark current and no smear are achieved throughthe adoption of R, G and B primary color mosaic filters. This chip features an electronic shutter with variablecharge-integration time.(Applications: Surveillance cameras)
sony CMOS傳感器datasheet，IMX178LQJ-C_Data_SheetDescriptionThe IMX178LQJ-C is a diagonal 8.92 mm (Type 1/1.8) CMOS active pixel type image sensor with a square pixelarray and 6.44 M effective pixels. This chip operates with analog 2.9 V, digital 1.2 V and interface 1.8 V triple powersupply, and has low power consumption.High sensitivity, low dark current and no smear are achieved through the adoption of R, G and B primary colormosaic filters.This chip features an electronic shutter with variable charge-integration time.(Applications: Surveillance cameras, FA cameras, Industrial cameras)
