代码搜索:Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/252063/12304829
c axb.c
/* Copyright (c) Colorado School of Mines, 2003.*/
/* All rights reserved. */
#include "cwp.h"
/*********************** self documentation **********************/
/**********
www.eeworm.com/read/252063/12304896
c sqr.c
/* Copyright (c) Colorado School of Mines, 2003.*/
/* All rights reserved. */
/*********************** self documentation **********************/
/******************************
www.eeworm.com/read/338293/12314424
m prrgmres.m
function [X,rho,eta] = prrgmres(A,L,N,b,k)
%PRRGMRES Preconditioned RRGMRES algorithm for square inconsistent systems
%
% [X,rho,eta] = rrgmres(A,L,N,b,k)
%
% PRRGMRES applies smoothing-norm prec
www.eeworm.com/read/338082/12325308
m huff_tbl.m
function table=huff_tbl(fre)
% Usage: table=huff_tbl(fre)
% generating huffman table to be used by huffman.m
% Using tree search method
%
% fre: p x 1 vector, consists of frequency counts of each
%
www.eeworm.com/read/149739/12353491
m nbayesc.m
%NBAYESC Bayes Classifier for given normal densities
%
% W = NBAYESC(U,G)
%
% INPUT
% U Dataset of means of classes
% G Covariance matrices (optional; default: identity matrices)
%
% OUTP
www.eeworm.com/read/149739/12353914
m kcentres.m
%KCENTRES Finds K center objects from a distance matrix
%
% [LAB,J,DM] = KCENTRES(D,K,N,FID)
%
% INPUT
% D Distance matrix between, e.g. M objects (may be a dataset)
% K Number of center
www.eeworm.com/read/337307/12377476
m findp.m
function P = findp(A);
%FINDP Nonsingular basis permutation matrix.
% P = FINDP(A) locates a permutation matrix such that
% the leading square matrix is nonsingular.If A has
% more column
www.eeworm.com/read/250746/12386985
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
www.eeworm.com/read/148895/12415863
readme
SparseLib++ v. 1.6: Numerical Sparse Matrix Classes in C++
SparseLib++ is a C++ class library for efficient sparse matrix computations
across various computational platforms. The software
www.eeworm.com/read/336521/12439481
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