搜索资源列表
acnv
- FFTD(T) performs a "Dimensionless DFT" on the columns of T. T may be real or complex. T may be any size. Returns the dimensionless (unitless) vector D and the universal Basis matrix B such that- FFTD(T) performs a "Dimensionless DFT" on the
linproj
- 模型是结构体类型的线性投影Y = linproj(X, model) 其中W.model为线性投影矩阵， Y = model.W *X + model.b b为偏差值- Descr iption: Y = linproj(X, model) linearly projects data in X such that Y = model.W *X+ model.b out_data = linproj(in_data, model) projects
MatrixProcessing
- 有两个方阵A、B，编程利用数组，求矩阵A与矩阵B的和矩阵C，并找出和矩阵C主对角线最大元素及其位置。 要求： 1）用自定义函数input实现数组的输入； 2）用自定义函数add实现矩阵的加运算； 3）用自定义函数diag_max实现查找； 4）在主函数输出和矩阵、输出查找结果。 -There are two square A, B, using an array of programming, find the matrix A and matrix B and matr
BytmianFangzhen
- B样条的方阵生成图形，利用MATLAB生成B样条的源码-B spline matrix generated graphics, the use of MATLAB source code generated B-spline
juzhen
- B样条的定义，并通过软件生成输出矩阵的数值-B-spline is defined and the output matrix generated by the numerical software
gaosisaier
- 迭代法求解线性方程组，首先将方程组AX=B中未知数X给定，计算出矩阵B。然后把矩阵B带入，利用雅各比迭代法反求X-Iterative method for solving linear equations, the first of equations AX = B will be in the unknown X given to calculate the matrix B. Then the matrix B into the use of Jacobi iterative method
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
konversi-bilangan
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
Penyelesaian-Pers-Non-Linier-Metode-Tabel
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
STRASSEN
- 矩阵乘法是线性代数中最常见的运算之一，它在数值计算中有广泛的应用。若A和B是2个n×n的矩阵，则它们的乘积C=AB同样是一个n×n的矩阵-Matrix multiplication is linear algebra is the most common operation, it is one of the numerical calculation is widely used. If A and B is 2 n* n matrix, then their product C = AB i
dsp2
- 在visual dsp++实现完成矩阵A*B+C*D 1. 其中（ABCD是六维矩阵） 2.有汇编语言和c语言两种算法编写 3.有子程序的调用 -Achieve complete with dsp matrix A* B+ C* D 1. Which (ABCD is a six-dimensional matrix) 2 with c language assembly language and write two algorithms 3 with subroutine ca
dsp-mutiple
- 完成矩阵A*B+C*D ? 其中：A, B, C和D矩阵都是六维矩阵 ? 要求有汇编语言和C语言两种算法编写 ? 要求有子程序的调用 -Complete the matrix A* B+ C* D ? One: A, B, C and D matrices are six-dimensional matrix ? requires assembly language and C language written two algorithms require a subroutine c
RM
- 计算两组向量之间的旋转矩阵。输入参数为在两个不同坐标系中的同名向量（模为1），返回参数是一个3X3的旋转矩阵。-The function of RM realize the rotation between two sets of vectors, whose magnitude are 1, defined in two different refrence frames. Input parameters are two sets of vectors r and b, return val
Untitled
- 对07 年b数学建模用matlab解决了如何求直达矩阵，程序简单-07 b of the use of mathematical modeling to solve how to find direct matlab matrix, the program simply
1
- 矩阵连乘算法，找出最适合的乘法方式。如矩阵为A B C，则在 A*B*C中找出最为适合的乘法方式。-Matrix multiplication algorithm with, identify the most suitable way of multiplication. Such as the matrix for the ABC, then the A* B* C multiplication to find the most suitable way.
SPLINE
- SPLINE is a package of simple routines for setting up and evaluating splines and related functions, whose goal is either to to interpolate given data exactly at a set of points to approximate data over an interval. There are a variety of
juzheng
- 实现四位矩阵a和四位矩阵b的乘法，最后存储在c矩阵中-Achieve four matrices a and b, four matrix multiplication, and finally stored in the c matrix
complex_gauss
- This is a program to calculate Ax = b using complex Gaussian elimination method. A is a coefficient matrix. x is an unknown value vector. b is a right-hand side known vector. We can get an unknown vector x. These vectors and matrix can have complex