基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of cofactor, adjoint, inverse, gauss, gaussjordan, linear transformation, LU decomposition , Gram-Schmidt process, similarity. b) Basic vectors functions : norm, distance, innerproduct,coldim, rowdim, rank, nullity. *
标签： matrix minor determinant transpose
上传时间： 2013-12-09
上传用户：541657925
提供基本榘阵 ( Matrix ) 运算 ( product 、 sum 、 difference、 transpose、 traceof ) 的非可视构件 ( 1.0 版，附源码 C++Builder 3.0/4.0/5.0 版适用 )，作者 : Jeff Hiscock。
标签： difference transpose product traceof
上传时间： 2013-12-17
上传用户：凤临西北
Common Martix Operation ,include transpose, qr-factorization, trangular martix
标签： qr-factorization Operation transpose trangular
上传时间： 2013-11-30
上传用户：xc216
并行算法下的transpose实现。在smp环境下用mpi编写
上传时间： 2016-10-08
上传用户：
cuda平台开发的矩阵变换并行操作（Matrix transpose），属于cuda sdk中的内容
标签： transpose Matrix cuda 平台开发
上传时间： 2017-04-24
上传用户：cylnpy
java code to calculate transpose of a matrix
标签： calculate transpose matrix java
上传时间： 2014-01-17
上传用户：cc1015285075
Matrix Transposition and Multiplication It is a MIPS assembly program that does the following: given two matrices, M1 and M2, first transpose M2 to obtain M2tran. Then multiply M1 and M2tran.
标签： Multiplication Transposition following assembly
上传时间： 2016-05-03
上传用户：kernaling
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- transpose the resulting matrix The code requires nested Parallelism.
标签： iterations performs Bailey number
上传时间： 2014-01-05
上传用户：libenshu01
批处理感知器算法的代码matlab w1=[1,0.1,1.1;1,6.8,7.1;1,-3.5,-4.1;1,2.0,2.7;1,4.1,2.8;1,3.1,5.0;1,-0.8,-1.3; 1,0.9,1.2;1,5.0,6.4;1,3.9,4.0]; w2=[1,7.1,4.2;1,-1.4,-4.3;1,4.5,0.0;1,6.3,1.6;1,4.2,1.9;1,1.4,-3.2;1,2.4,-4.0; 1,2.5,-6.1;1,8.4,3.7;1,4.1,-2.2]; w3=[1,-3.0,-2.9;1,0.5,8.7;1,2.9,2.1;1,-0.1,5.2;1,-4.0,2.2;1,-1.3,3.7;1,-3.4,6.2; 1,-4.1,3.4;1,-5.1,1.6;1,1.9,5.1]; figure; plot(w3(:,2),w3(:,3),'ro'); hold on; plot(w2(:,2),w2(:,3),'b+'); W=[w2;-w3];%增广样本规范化 a=[0,0,0]; k=0;%记录步数 n=1; y=zeros(size(W,2),1);%记录错分的样本 while any(y<=0) k=k+1; y=a*transpose(W);%记录错分的样本 a=a+sum(W(find(y<=0),:));%更新a if k >= 250 break end end if k<250 disp(['a为：',num2str(a)]) disp(['k为：',num2str(k)]) else disp(['在250步以内没有收敛，终止']) end %判决面：x2=-a2*x1/a3-a1/a3 xmin=min(min(w1(:,2)),min(w2(:,2))); xmax=max(max(w1(:,2)),max(w2(:,2))); x=xmin-1:xmax+1;%(xmax-xmin): y=-a(2)*x/a(3)-a(1)/a(3); plot(x,y)
上传时间： 2016-11-07
上传用户：a1241314660
