搜索资源列表
rk4
- function [tout, yout] = rk4(ypfun, tspan, y0, h) ％定步长四阶Runge-Kutta法求常微分方程(组)数值解 ％[tout,yout] = rk4( ypfun , tspan, y0,h) ％ 这里字符串ypfun是用以表示f(t, y)的M文件名, ％ tspan=[t0, tfinal]表示自变量初值t0和终值tf ％ y0表示初值向量y0，h是步长。 ％ 输出列向量tout表示节点 (t0 , t1 , … ,
tu
- [输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达
plotMatrix
- ％ If only 1 output is specified, then dataout (a matrix the same size as ％ data) is returned. The order of t and align is immaterial, as long as ％ the data matrix is input first.
转置矩阵
- 转置矩阵是10*10矩阵A的转置矩阵A（t）-matrix is home to 10 * 10 A matrix transpose matrix A (t)
svm465
- This toolbox was designed as a teaching aid, which matlab is particularly good for since source code is relatively legible and simple to modify. However, it is still reasonably fast if used with the supplied optimiser. However, if you really want to
generate_H
- dmb-th标准中关于LDPC中稀疏矩阵及校验矩阵的源代码，附有校验矩阵-dmb-th standard in on the LDPC check matrix sparse matrix and the source code, with parity matrix
lipschit
- Determine the lag space. ％ Given a set of corresponding inputs and outputs the ％ function calculates a matrix of indices, which can be ％ helpful when trying to determine a proper lag space structure ％ (m and n) before identifying a model of
encryption
- The program takes 3 inputs: 1. A letter of the alphabet that will remain unencoded (e.g. "J") 2. A 5-letter keyword (e.g. "BREAK") 3. A message to be encrypted (e.g. "COMPUTERSCIENCE"). You may assume that it does not contain any spaces or p
MatrixCtrl
- 这是一个矩阵字体现显示控件，使用简单，首先插入该CMatrixCtrl控件的.h和 .cpp文件到您的项目,添加一个静态控件到您的对话框资源，把静态控件修改声明为CMatrixCtrl类的一个成员变量。-This is an attempt to create a control which looks a little bit like the credits of the Matrix movie. While it isn t the greatest clone of the Matri
saveascii
- Save or display a matrix with given precision, delimiter or format for each (or every) column.-With this program you can save (or display) your data with a different format and delimiters for every column, given as optional inputs in a user-friendly
kalman_filter
- OPTIONAL INPUTS (string/value pairs [default in brackets]) model - model(t)=m means use params from model m at time t [ones(1,T) ] In this case, all the above matrices take an additional final dimension, i.e., A(:,:,m), C(:,:,m), Q(:,:,m), R
minWeight
- 一凸8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。-A convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the s
t-copulas
- ClaytonRND Random matrix from a Clayton n-copula.Build and share code simulating Clayton n-copula n>2 indeed it possible to extend letting alpha be a vector of size n, each entry >0 but could be different. U = ClAYTONRND(ALPHA, N, M) returns
clapack-3.2.1-CMAKE
- 大型矩阵相关运算源程序及其说明，里面包括了各种线性代数的源程序-Source of large matrix-related operations and its descr iption, which includes a variety of linear algebra source
maxkurtica
- 一种新的基于峭度的盲源分离开关算法。程序调用说明：该算法程序调用格式为[y,w]=bksa(x),其中x是一个n*T的数据矩阵，y是估计出的源信号矩阵，w是n*n分离矩阵。-A new kurtosis-based switch algorithm for blind source separation. Program calls Note: The algorithm program calls the format [y, w] = bksa (x), where n* T x is a
pls_copy
- 这是一个非线性回归偏最小二乘程序，输入因变量与自变量，输出为x，y的主成分与负荷因子与回归系数- Inputs: x x matrix y y matrix Outputs: t score for x p loading for x u score for y q loading for y b regression coefficient
dayin
- 编写螺旋方阵。其中螺旋方阵形式如下： 1 12 11 10 2 13 16 9 3 14 15 8 4 5 6 7 设row,column分别代表行、列坐标，变量p从1到n2将p依次存入数组a[row][column]中，要确定row、colomn的变化情况。分析如下：引进变量k，初值为n。当数据存入到左下角或右上角时，k减1，这样可保证输出时方阵。引进变量t，初值为1，当数据存入到右下角时，令t改变符合，当存入到左上角时，t又改变符合，这样可保证赋值到正确的数组坐标
T
- 单个粒子散射T矩阵算法，包括柱，椭球和切比雪夫粒子-A single particle scattering T matrix algorithm
extended precision
- 计算sokes散射传输矩阵，相位函数，尺度分布，偏振计算，用于对气溶胶粒子形状分析(Calculate the sokes scattering matrix)
最小生成树Prim算法
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可(The Dandn file gives the name and format of the input parameter That is, before entering prim, the adjacency matrix D and the number of nodes n are input Input prim G