代码搜索：Matrices
找到约 3,616 项符合「Matrices」的源代码
代码结果 3,616
www.eeworm.com/read/427511/8938429
m golub.m
function A = golub(n)
%GOLUB Badly conditioned integer test matrices.
% GOLUB(n) is the product of two random integer n-by-n matrices,
% one of them unit lower triangular and one unit upper tr
www.eeworm.com/read/283910/8979891
c confmat.c
/*************************************************************************/
/* */
/* Routine for printing confusion matrices */
/* --------------------------------------- */
/*
www.eeworm.com/read/382131/9047017
txt transform.txt
The matrices used to describe model transformations are affine 4x4 matrices
which are D3D style, row major with translations in the 4th row.
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
The tran
www.eeworm.com/read/182905/9186043
m jdb2.m
% Calling the joint approximate diagonalization function.
M=3 % dimension
N=3 % Number of matrices
snr=0.025
seuil = 1.0e-12; % precision on joint diag
K=1
for k=1:K
k
% drawi
www.eeworm.com/read/182905/9186054
m jd2.m
% Calling the joint approximate diagonalization function.
m=5 % dimension
n=3 % number of matrices
seuil = 1.0e-12; % precision on joint diag
compteur=0;
while 1 ; compteur=
www.eeworm.com/read/178061/9420802
m missmult.m
function [X]=missmult(A,B)
%MISSMULT product of two matrices containing NaNs
%
%[X]=missmult(A,B)
%This function determines the product of two matrices containing NaNs
%by finding X according t
www.eeworm.com/read/176712/9487327
c confmat.c
/*************************************************************************/
/* */
/* Routine for printing confusion matrices */
/* --------------------------------------- */
/*
www.eeworm.com/read/365527/9858552
asv exa1_7.asv
>>t='How about this character string?'
>>u=t(16:24)
>>u=t(24:-1:16)
>>u=t(16:24)'
>>v='I can''t find the manual!'
>>u='If a woodchuck could chuck wood,';
>>v='how much wood would a woodchuck
www.eeworm.com/read/365527/9858560
m exa1_7.m
t='How about this character string?'
u=t(16:24)
u=t(24:-1:16)
u=t(16:24)'
v='I can''t find the manual!'
u='If a woodchuck could chuck wood,';
v='how much wood would a woodchuck chuck?';
w=[u
www.eeworm.com/read/168218/9931601
cpp rmult.cpp
// dynamic programming recursive matrix multiplication chains
#include
#include "make2db.h"
int r[7] = {0, 10, 5, 1, 10, 2, 10};
int **kay;
int C(int i, int j)
{// Return c(