搜索：diagonal
找到约 11 项符合「diagonal」的查询结果
结果 11
按分类筛选
https://www.eeworm.com/dl/665/433869.html
matlab例程
The following Matlab code converts a Matrix into it a diagonal and off-diagonal component and perfor
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
https://www.eeworm.com/dl/641/481831.html
数学计算
Replace every element on the diagonal of an array with the sum of the elements on the current column
Replace every element on the diagonal of an array with the sum of the elements on the current column OR row. Labview
https://www.eeworm.com/dl/909339.html
技术资料
非线性对角占优性
Another concept of generalized diagonal dominance for nonlinear functions (i.e. quasi-generalized
https://www.eeworm.com/dl/641/256144.html
数学计算
2． Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve
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
https://www.eeworm.com/dl/665/283897.html
matlab例程
This function obtains a unitary matrix Q such that: d=diag(Q *diag(lmd)*Q). In other words, it gi
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 (wi ...
https://www.eeworm.com/dl/654/174575.html
数据结构
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Com
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.
https://www.eeworm.com/dl/641/175667.html
数学计算
平均因子分解法
平均因子分解法，适用于正定矩阵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) ...
https://www.eeworm.com/dl/654/450069.html
数据结构
迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
迷宫算法（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 all ...
https://www.eeworm.com/dl/511493.html
数学计算
计算本征值程序
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 ...
https://www.eeworm.com/dl/835863.html
技术资料
sony CMOS传感器 IMX385LQR-C DataSheet
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 consump ...