搜索资源列表
3
- 下三角复矩阵求逆的ASIC设计及实现 论文 pdf-Lower triangular complex matrix inverse of the ASIC Design and Implementation of
Gauss-Jordan
- Gauss-Jordan消去法 实现矩阵求逆 有详细算法解释-Gauss-Jordan elimination method to achieve matrix inverse Algorithm is explained in detail
matrix
- 一种很好用的求逆矩阵方法，检查过了，没有错误哦-A good use of the inverse matrix method, checked, and no error oh
parallel-invert
- 矩阵求逆的并行计算实现，带数据 mpi+vc6.0-parallel compute of matrix inverse
inverse
- 主要内容：在visual studio上实现矩阵求逆的过程 矩阵求逆：用全选主元高斯约当消去法求n阶是矩阵A的逆矩阵A-1。其中包括矩阵求逆算法描述 -Main elements: the visual studio to achieve the process of matrix inversion matrix inversion: The Select pivot Gauss Jordan elimination order to n-order matrix A is the i
1
- 将一幅256*256的图像分成8*8的小块，对其进行DFT变换。分别比较在空间域和频域内对源图像进行二次抽样和差值最后比较不同-1. Get a grey level image which size is N*N. (For example, 256*256, however, N = ), and partition to 8*8 sub images. 2. Apply DFT to these sub images, and get the fourier transfor
jj
- 使用VisualC++实现的伪逆矩阵的计算方法，Dlg编程。-Using VisualC++ implementation of the pseudo-inverse matrix method of calculation, Dlg programming.
wrec
- We consider a complex-valued wavefield reconstruction in an object plane from data in a sensor plane. A digital modeling for the forward propagation is presented in the algebraic matrix form M-DDT. The inverse propagation is formalized as an inverse
inverse_matrix_gauss
- os : window vista 32bit compiller : visual c++ 6.0 n*n inverse matrix program use Gauss elimination
inv.csharp
- to find the inverse of a matrix using csharp
MatrixInverse
- 用C语言来实现工程上常见的复数矩阵的逆问题。-Use the C language to implement common complex matrix inverse problem in the projects.
qq
- 跡數(trace),也就是對角線數據的總和,轉置矩陣(Transpose Matrix),則是將矩陣數據列跟欄對調將橫的數據變成直的,反矩陣(Inverse Matrix)它的定義為與目標矩陣相乘可以得到單位矩陣,為一個可逆矩陣. 跡數,轉置,反矩陣實作-Trace number (trace), which is the sum of diagonal data, Transpose (Transpose Matrix), malpractices matrix data will
MatrixInverse
- 矩阵求逆 :一个简单的小例子常用于普通计算。-matrix inverse :a simple instance for common compute
inverse
- 矩阵求逆,这里要介绍的矩阵求逆算法称为全选主元高斯-约旦法-inverse of matrix
doolittle
- LU分解在本质上是高斯消元法的一种表达形式。实质上是将A通过初等行变换变成一个上三角矩阵，其变换矩阵就是一个单位下三角矩阵。这正是所谓的杜尔里特算法（Doolittle algorithm）：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。 这类算法的复杂度一般在左右，对充分消元的分解则不然。 -LU decomposition is esse
matrix
- 一个很简单的矩阵类，有四则运算、转置、求逆的功能-A very simple matrix class, there are four operations, transpose, inverse function
Matrix_math
- 矩阵类，实现矩阵的求逆，广义逆，特征向量等-Matrices to achieve the inverse matrix, inverse, eigenvectors, etc.
Matrix
- 能计算行列式，逆矩阵，矩阵加减乘法，界面一般-Determinant of the inverse matrix calculation of addition and subtraction multiplication
TDtest
- 针对于对一般矩阵的求逆，或对复杂系统的求逆-Aimed at the general matrix inverse or inverse complex systems