搜索资源列表
ok
- 以字符形式打开文件 其中x.txt是数据文件 16进制转化为10进制数，存入alpha矩阵 将得出数据存入新的b.txt文档 - Open the file in characters which are data files x.txt hexadecimal to decimal conversion, alpha matrix deposit will yield data into a new document b.txt
5.5MATLAB
- 输入一副图像，检测图像的RGB，并输出其值的矩阵，将符合公式R>Rt，R>G>B,S>=(255-R)*S/R,等的图像点标记出来，并输出图像-A pair of input images, the image detecting RGB, and outputs the value of the matrix, would be consistent with the formula R> Rt, R> G> B, S> = (255-R)* S
d
- 稀疏矩阵的压缩存储： 实现稀疏矩阵压缩存储，并实现矩阵转置和求和。 输入矩阵时，首先需要输入非零元素的个数，然后分别输入矩阵的 行号，列号和值。 输完2个矩阵后，自动进行计算第一个矩阵的转置以及两个矩阵的和。 例如：输入如下： 100 90 5 //矩阵的行数为100，列数为90，共5个非零元素。 1 10 100 //a(1,10)=100 50 60 200//a(50,60)=200 50 80 100//a(50,80)=10
ssi
- krylov子空间法 krylov子空间方法的程序实现，用于解高阶矩阵-Matlab Codes for Krylov subspace methods 1. MINRES method by Paige and Saunders implementation function [ x, istop, itn, rnorm, Arnorm, Anorm, Acond, ynorm ] = ... minres( A, b, M, shift, show, check, itnlim
Cholesky-decomposition
- 实对称正定矩阵的 的Cholesky分解.用平方根法和改进的平方根方法求解线性方程组 Ax=b. -Real symmetric positive definite matrix of the Cholesky decomposition method and improved by the square root of the square root method for solving linear equations Ax = b.
dft
- 其中dft.m 是通过该程序同时输出图片1,2的R、G、B三通道的DFT正反变换图、相角图、幅度图，图片1,2的彩色DFT正反变换图以及DFT后图片1,2幅度相位信息置换后的彩色结果图。 dct.m是通过该程序显示“实验室用原图像”中的图片3的R、G、B三通道DCT正反变化对比图，变换系数图以及彩色DCT正反变换图。 compress.m是通过该程序输出图片3的保留n个DCT变换系数重构彩色结果图。需要说明的是其中决定保留系数个数n的mask矩阵需要手动更改。-Wherein
fastest
- 最速下降法求解方程f=1/2x *A*x+b *x求其极小值点，其中梯度g=Ax-b,下降方向p=-g，x为初始点，eps为精度。 注：本程序只适用于二次方程，即方程的A矩阵不含未知数。-Steepest descent method for solving the equation f = 1/2x * A* x+ b * x seeking the minimum point where the gradient g = Ax-b, the descent direction p =-
householder
- 求解一个给定的大规模（<10000个方程）超定线性方程组Ax=b。 读取矩阵A和b； 设计算法求解线性方程组 ，并打印解向量 ； 计算残差e=||Ax-b||，并打印。-Solving a given mass (<10 000 equations) overdetermined system of linear equations Ax = b. Read a matrix A and b Design algorithm for solving linear
LSQR-NNL
- 可用于求解超大规模线性方程组非负解的MATLAB函数-Given a tall full-rank matrix A, solves the nonnegative least squares problem: min ||Ax-b|| s.t. x>= 0 and returns the minimizer x. The argument err is the tolerance used in testing for zeros
BCMUL
- 求m*n阶直矩阵A与n*k阶重短阵B的乘积矩阵C= AB-Find m* n-order linear matrix A and n* k matrix B short-order heavy product matrix C = AB
BRMUL
- 求m*n阶矩阵A与n*k阶矩阵B的乘积短阵.-Find m* n order matrix A and n* k matrix B short order matrix multiplication of.
2013082711183910
- 对于由n个未知数，n个方程组成的组多元一次方程组： a11X1+a12X2+．．．+a1nXn = b1 a21X1+a22X2+．．．+a2nXn = b2 ．．．．．． an1X1+an2X2+．．．+annXn = bn 写成矩阵形式为Ax=b，其中A为系数n*n方阵，x为n个变量构成列向量，b为n个常数项构成列向量。当它的系数矩阵可逆，或者说对应的行列式|A|不等于0的时候，由Ax=b可得：x=b*A-1 ，A-1为A的逆矩阵。-For the group consi
delayspre
- required by the algorithm[8]. The step size parameter controls the convergence speed. Hence the algorithm depends on the step size. The step size is a positive constant value which control the size of increment applied in one iteration to the next. T
code-(2)
- Using MATLAB tools for MLP NNs (e.g., newff, …), design a two-layer feed-forward neural network as a classifier to categorize the input geometric shapes. - The snapshot and bitmap of shapes are given: - Training shapes: shkt.bmp - Training p
k
- 用K均值聚类分析把多组数据分成两类 本程序为给定20组数据（用矩阵A表示）分成B、C两组。-K-means clustering analysis of the multiple sets of data into two categories This program is given 20 sets of data (represented by the matrix A) into B, C groups.
struct2mat
- [X,n]= STRUCT2MAT(S) converts a structre S into a numeric matrix X. The contents of each *numeric* field of S (either a vector or a matrix) will form 1 column of X. Fieldnames are returned in cell array n . If the fields of S aren t of the s
kalman
- Kalman Filter , AN SIMPLE IMPLEMENTATION OF A CALMAN FILTER requires H,B,R,Q matrix implementation for better results
SolveLinearEqutations
- 全选主元高斯-约当消去法求解稀疏线性方程组 输入参数a[]系数矩阵，n线性方程阶数，b[]右端项 输出参数b[]方程组的解 返回值 ： 1求解成功 0求解失败-Select the main element Gauss- Jordan elimination method for solving sparse linear equations Input parameters a [] coefficient matrix, n order linear equations, b
sparsematrix
- 稀疏矩阵的计算速度更快,因为M AT L A B只对非零元素进行操作,这是稀疏矩阵的一个突出的优点.-Sparse matrix calculation speed is faster, because M AT LAB only non-zero elements to operate, which is an advantage of a sparse matrix prominent.
dianzhen
- 该源代码基于2代B+型树莓派，并利用两块8*8的点阵通过相应连接，在树莓派中执行该源代码，即能够使点阵显示字体。-The source code is based on the second generation Type B Raspberry Pi, and the use of two 8* 8 dot matrix through the corresponding connection, the implementation of the source code in raspberr