代码搜索：Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/281807/9133117
m rwg3.m
%RWG3 FREQUENCY LOOP
% Calculates the impedance matrix using function IMPMET
% and solves MoM equations
% Uses the mesh file from RWG2, mesh2.mat, as an input.
% Includes three additional
www.eeworm.com/read/183815/9137139
m contents.m
% LAMBDA toolbox
% Version V2.0 dd. 19-05-1999
%
% Main routines:
% lambda1 - Integer estimation, extended options
% lambda2 - Integer estimation, basic options
%
% Demonstration:
% ldemo
www.eeworm.com/read/183815/9137174
m lambda2.m
function [afixed,sqnorm,Qahat,Z] = lambda2 (afloat,Qahat)
%LAMBDA2: Integer ambiguity estimation using LAMBDA (basic version)
%
% This routine performs an integer ambiguity estimation using the
%
www.eeworm.com/read/380446/9148803
inl linearequation.inl
//LinearEquation.inl 线性方程(组)求解函数(方法)定义
// Ver 1.0.0.0
// 版权所有(C) 何渝, 2002
// 最后修改: 2002.5.31
#ifndef _LINEAREQUATION_INL
#define _LINEAREQUATION_INL
//全选主元高斯消去法
template
int L
www.eeworm.com/read/183445/9158615
m validate.m
function [cost,nmodel,output] = validate(model, Xtrain, Ytrain, Xtest, Ytest,estfct, trainfct, simfct)
% Validate a trained model on a fixed validation set
%
% >> cost = validate({X,Y,type,gam,sig2}
www.eeworm.com/read/379991/9169498
cpp 八皇后(改进)（函数回溯）.cpp
//////////////////////////////////////////////////////
//采用回溯法求解n皇后问题
//用函数进行回溯
//
//经过适当的优化后可以算到32
//
//完成于2007.7.15
//张锦
///////////////////////////////////////////////////////
#include
www.eeworm.com/read/379828/9174505
m cca.m
function [Z, ccaEigen, ccaDetails] = cca(X, Y, EDGES, OPTS)
%
% Function [Z, CCAEIGEN, CCADETAILS] = CCA(X, Y, EDGES, OPTS) computes a low
% dimensional embedding Z in R^d that maximally preserves ang
www.eeworm.com/read/379733/9179931
m cut.m
function v = cut(a, up, down)
% CUT cut down values of matrix that are not between given limits
%
% Usage:
% B = CUT(A, up, down)
% will return a matrix with all values in A greater than up
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