代码搜索：Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/228652/14371532
m iszero.m
function yesno = iszero(P)
% ISZERO -- check whether matrix polynomial is zero
%
% yesno = iszero(P)
%
% If the matrix polynomial P contains only entries which are zero
% (within toleran
www.eeworm.com/read/228652/14371624
m issymbolic.m
function yesno = issymbolic(P)
% ISSYMBOLIC -- check whether matrix polynomial contains symbolic variables
%
% yesno = issymbolic(P)
%
% This is NOT the converse of ISNUMERIC. The purpose
www.eeworm.com/read/228652/14371643
m mpower.m
function Pn = mpower(P,n)
% MPOWER -- power of matrix polynomial
%
% Pn = P^n
% Pn = mpower(P,n)
%
% This function is not meant to be called by the user. It is called by
% Matla
www.eeworm.com/read/228533/14380247
c orddithr.c
/*
Ordered Dithering
by Stephen Hawley
from "Graphics Gems", Academic Press, 1990
*/
/* Program to generate dithering matrices.
* written by Jim Blandy, Oberlin College, jimb@occs.oberlin.edu
* Gif
www.eeworm.com/read/228372/14387916
m disteusq.m
function d=disteusq(x,y,mode,w)
%DISTEUSQ calculate euclidean, squared euclidean or mahanalobis distance D=(X,Y,MODE,W)
%
% Inputs: X,Y Vector sets to be compared. Each row contains a data
www.eeworm.com/read/228372/14388024
m ldatrace.m
function [a,f,B,W]=ldatrace(b,w,n,c)
%LDATRACE Calculates an LDA transform to maximize trace discriminant [a,f,B,W]=(b,w,n,c)
% If a feature vector X can come from one of several class and W and B a
www.eeworm.com/read/227522/14421553
m mvaar.m
function [x,e,Kalman,Q2] = mvaar(y,p,UC,mode,Kalman)
% Multivariate (Vector) adaptive AR estimation base on a multidimensional
% Kalman filer algorithm. A standard VAR model (A0=I) is implemented. The
www.eeworm.com/read/224815/14567153
cpp main.cpp
#include
#include
void MatrixChain(int *p, int n, int *m, int *s)
{
for(int i = 0; i < n; i++)
*(m + i * n + i) = 0;
for(int r = 1; r < n; r++)
for(i = 0; i
www.eeworm.com/read/124283/14579282
texi eigen.texi
@cindex eigenvalues and eigenvectors
This chapter describes functions for computing eigenvalues and
eigenvectors of matrices. There are routines for real symmetric and
complex hermitian matrices, and
www.eeworm.com/read/224369/14595504
readme
%---------------------------------------------------------
%
% Copyright 1997 Marian Stewart Bartlett
% This may be copied for personal or academic use.
% For commercial use, please contact Marian Ba