代码搜索：Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/482347/6623162
m semplicecorr.m
function [delta,dev,cor,C] = semplicecorr(DX,DR,legame)
%SEMPLICECORR correlation between risk factors and assets (normal method).
%
% [delta,dev,cor,C] = semplicecorr(DX,DR,legame) calculates the ve
www.eeworm.com/read/482154/6628636
java network.java
/**
* Network
* Copyright 2005 by Jeff Heaton(jeff@jeffheaton.com)
*
* Example program from Chapter 11
* Programming Neural Networks in Java
* http://www.heatonresearch.com/articles/series
www.eeworm.com/read/481066/6657299
m anal1.m
function [E,Nc,mCe,mC,T] = anal1(M,D,st,s);
%
% Ph.D. Thesis
% Copyright by Leandro Nunes de Castro
% March, 2000
% Immune Network (iNet) - Description in iNet.doc
% Function determines the Mi
www.eeworm.com/read/481066/6657307
m anal3.m
function [E,Nc,mC,T] = anal3(M,D,st,s);
%
% Ph.D. Thesis
% Copyright by Leandro Nunes de Castro
% March, 2000
% Immune Network (iNet) - Description in iNet.doc
% Function determines the Minima
www.eeworm.com/read/481066/6657308
m analysis.m
function [E,bE,Nc,mCe,mC,T,U] = analysis(M,D,st,s);
%
% Ph.D. Thesis
% Copyright by Leandro Nunes de Castro
% March, 2000
% Immune Network (iNet) - Description in iNet.doc
% Function determine
www.eeworm.com/read/478750/6702133
asv uint2double.asv
function [y]=uint2double(x,scale,diff_matrix)
z=x.*scale;
z=z+diff_matrix;
y=z;
www.eeworm.com/read/478750/6702135
m uint2double.m
function [y]=uint2double(x,scale,diff_matrix)
z=x.*scale;
z=z+diff_matrix;
y=z;
www.eeworm.com/read/478563/6710001
m randintr.m
% ATLAST65中生成给定阶、给定秩的整数矩阵的子程序randintr
%
function A = randintr(m,n,k,r)
% RANDINTR(m,n,k,r) is an m by n matrix of rank r
% with integer entries in the interval [-k:k].
% If less than three argume
www.eeworm.com/read/478033/6718216
pas ctrlinsolve.pas
unit ctrlinsolve;
interface
uses Math, Ap, Sysutils;
function ComplexSafeSolveTriangular(const A : TComplex2DArray;
N : Integer;
var X : TComplex1DArray;
IsUpper : Boolean;
www.eeworm.com/read/477455/6735938
m tdma.m
function X = TDMA(A,D,C,B)
% Tridiagonal Matrix Algorithm（三对角阵算法）
%
% Function: to solve the Tridiagonal system CX=B, where C is a Tridiagonal matrix
%
% Input - A is the subdiagonal of the