搜索资源列表
cholesky
- Cholesky分解是一种分解矩阵的方法, 在线形代数中有重要的应用。Cholesky分解把矩阵分解为一个下三角矩阵以及它的共轭转置矩阵的乘积（那实数界来类比的话，此分解就好像求平方根）。与一般的矩阵分解求解方程的方法比较，Cholesky分解效率很高-Cholesky decomposition is a kind of decomposition of matrix method, the linear algebra has an important application. Choles
Quick_Drawing_II
- 绘制由传递矩阵法计算得出的声子晶体能带图。使用了matplotlib和wxpython两个工具包。-Plot the band structures of phononic crystals which obtained by the transfer matrix method. Developed by two packages: matplotlib and wxpython.
Gauss-Jordan-Matrix
- For inverting a matrix, Gauss-Jordan elimination is about as efficient as any other method. For solving sets of linear equations, Gauss-Jordan elimination produces both the solution of the equations for one or more right-hand side vectors b, and also
Matrix-eigenvalue-and-vector
- 化对称矩阵为对称三对角阵，求对称三对角阵的全部特征值与向量。雅可比法。-Of symmetric matrix is symmetric three pairs of diagonal matrices, Symmetric Tridiagonal Matrix all eigenvalues and vectors. Jacobi method.
Matrix-factorization-C-program
- 矩阵分解的C程序 包括有矩阵的LU分解，矩阵的UU分解还有共轭梯度法-Matrix decomposition of the C program, including a matrix LU decomposition, the UU decomposition of the matrix conjugate gradient method
conjugate-gradient-method
- 用共轭梯度法求解系数矩阵为对称正定矩阵的二次函数的最优解-The optimal solution of the quadratic function using the conjugate gradient method for solving the coefficient matrix is symmetric positive definite matrix
Admittance-matrix-inversion
- 程序使用高斯消去法实现导纳矩阵形成阻抗矩阵（即求逆）运算。采用带行辅助向量的三元组表来存储由给定文件中各支路参数形成的节点及导纳数据，其中三元组中导纳类型为复数类。可以通过查找函数结合辅助向量实现对指定行列的元素的查找和输出。-The program uses the Gaussian elimination method to achieve admittance matrix to form the impedance matrix (inverse) operator. With adju
Diag_loading
- 阵列处理作业，MVDR或者其他高分辨方法，由于信号源无法确定，造成估计误差，采用对角加载的 增加单位阵法 ,以及 六源准则法 获取优化结果。-Array processing, MVDR, or other high-resolution method, the source can not be determined, resulting in the estimated error, the use of diagonal loading ' to increase the unit
smatrix4me2
- 基于平面波展开的传输矩阵方法是电磁计算中很重要也很实用的一种方法。本代码是这种算法的c语言实现。-The plane wave based transfer matrix method is a powerful tool for optical calculation of multilayered structures.
Matrix-multiplication
- After we defined size and value of first two matrices we used Environment.ProcessorCount to determine number of processors in system. Each processor computes almost equal amount of elements in result matrix.We used method _computeMatrix3() to compute
REMA
- 采用递推增广矩阵法的系统辨识仿真算法。我的Matlab是7.6.0版本-Recursive augmented matrix method of system identification simulation algorithm. My Matlab is 7.6.0 version
co_occurrence-matrix
- 灰度共生矩阵 在提取纹理特征时存在的问题，提出一种基于方块编码（BTC）的图像纹理特征的检索算法。 -gray level co-occurrence matrix A novel image retrieval method based on block truncation coding(BTC) is proposed to solve the problems of gray level co-occurrence matrix
Conjugate-Gradient-Method
- 共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。-Conjugate gradient method (Conjugate Gradient) between the steepest descent between law and Newton'
schrodinger2
- This code is NUMBER1: MATLAB code for paper: calculation of electron energies in a quantum well using the transfer matrix method. we solve the time independent schrodinger equation in 1D AlGaAs/GaAs/AlGaAs quantum well using the transfer matr
POWER-METHOD-FOR-EIGENVALUES
- POWER METHOD********************************************************* * PROGRAM FOR DETERMINATION OF HIGHEST AND LOWEST EIGENVALUES * * (SPECTRAL RADIUS)OF A SQUARE MATRIX -POWER METHOD*********************************************************
Newton
- 压缩包里包含了无约束优化问题常用的几种求解方法的源程序：变量轮换法（variable_rotation.m）、最速下降法（steepest_descent.m）、修正牛顿法（modified_newton.m）、共轭梯度法（conjugate_gradient.m）。另外，coefficient_matrix.m为目标函数系数获得矩阵，minval.m为最小值计算函数，gradient.m为梯度计算函数-Compression bag contains unconstrained optimiz
ARSMn
- 响应面方法的一个例子，二阶响应面面，使用正交矩阵法求解 -An example of the response surface method, using orthogonal matrix method for solving second-order response PowerPhone
matrix
- 共轭梯度法可以实现正定线性方程组的求解，并可以通过实例进行验证-Conjugate gradient method can achieve positive definite linear equations, and can be verified by an example
6-LU-of-matrix
- 实现一般非奇异矩阵的LU分解，利用全选主元的方法实现。-General non-singular matrix LU decomposition, pivoting method.
Numerical-method-solve-equations
- 数值方法解方程组AX=B（LU分解），过程分3步，首先，分解系数矩阵A=LU，然后，解LY=B，最后再求UX=Y 另一种是直接求解的（2.1）-Numerical method to solve the equations AX = B (LU decomposition), 3 step process, first of all, the decomposition of the coefficient matrix A = LU, then, Xie LY = B, and finally