代码搜索:Matrices

找到约 3,616 项符合「Matrices」的源代码

代码结果 3,616
www.eeworm.com/read/100395/15874855

html descript.html

Newmat09 - general description General description next - skip - up
www.eeworm.com/read/347945/11623363

m mpt_enumeration_mpmilp.m

function model = mpt_enumeration_mpmilp(Matrices,options) % Variable bounds when all binary variables are relaxed [global_lower,global_upper] = mpt_detect_and_improve_bounds(Matrices,Matrices.lb,Mat
www.eeworm.com/read/193277/8241842

m mpt_enumeration_mpmilp.m

function model = mpt_enumeration_mpmilp(Matrices,options) % Variable bounds when all binary variables are relaxed [global_lower,global_upper] = mpt_detect_and_improve_bounds(Matrices,Matrices.lb,Mat
www.eeworm.com/read/386050/8768091

m prmemory.m

%PRMEMORY Set/get size of memory usage % % N = PRMEMORY(N) % % N : The desired / retrieved maximum size data of matrices (in % matrix elements) % % DESCRIPTION % This retoutine sets or ret
www.eeworm.com/read/183393/9160045

htm root_mean_square_deviation.htm

RMSD: Root Me
www.eeworm.com/read/182905/9186042

m schura.m

function [V,D]=schurb(A,jthresh) % Joint approximate Schur transformation % % Joint approximate of n (complex) matrices of size m*m stored in the % m*mn matrix A by minimization of a joint diagon
www.eeworm.com/read/182905/9186048

m jda.m

% Calling the joint approximate diagonalization function. M=3; % dimension N=3; % Number of matrices snr=0.25; jthresh = 1.0e-12; % precision on joint diag K=1; for k=1:K k; %
www.eeworm.com/read/379563/9193514

m acsobiro.m

function [H,S,D]=acsobiro(X,n,p), % Program implemented and improved by A. Cichocki % on basis of the classical SOBI algorithm of Belouchrani. % Attention for noisy data you should take at least
www.eeworm.com/read/379294/9201237

readme

This directory contains the last two test problems as described in README of the directory above this one. zlatev.f : three different codes to generate matrices from the Zlatev et. al.
www.eeworm.com/read/166509/10017302

m contents.m

% TDSEP ICA tools version 2.01, 2/14/99 by AZ % % This is a simple and efficient MATLAB implementation of blind source separation. % Along the lines of Schuster and Molgedey [1] two (lagged) correl