代码搜索：Matrices
找到约 3,616 项符合「Matrices」的源代码
代码结果 3,616
www.eeworm.com/read/193277/8241841
m mpt_enumerate_binary.m
function [enums,Matrices] = mpt_enumerate_binary(Matrices)
binary_var_index = Matrices.binary_var_index;
notbinary_var_index = setdiff(1:Matrices.nu,binary_var_index);
% Detect and extract pure
www.eeworm.com/read/140704/5783300
cc tr_st_set_4.cc
// file: tr_st_set_4.cc
//
// isip include files
//
#include "train_state.h"
#include "train_state_constants.h"
// method: set_covar_cc
//
// arguments:
// float_4** covar : (input) covar matrices
www.eeworm.com/read/140704/5784052
cc st_set_4.cc
// file: st_set_4.cc
//
// isip include files
//
#include "state.h"
#include "state_constants.h"
// method: set_covar_cc
//
// arguments:
// flaot_4** covar : (input) covar matrices
//
// return:
www.eeworm.com/read/131315/5937674
assoc
Using associations
Associations are special values that act like matrices, except
that they are more general (and slower) than normal matrices.
Unlike matrices, associations can be indexed by arbi
www.eeworm.com/read/303463/3810175
m mpt_enumerate_binary.m
function [enums,Matrices] = mpt_enumerate_binary(Matrices)
binary_var_index = Matrices.binary_var_index;
notbinary_var_index = setdiff(1:Matrices.nu,binary_var_index);
% Detect and extract pure
www.eeworm.com/read/422941/10599982
m testjacobisamematrices.m
%testJacobiSameMatrices calls jacobi() for ten random matrices and uses
%the same matrices with jacobiNoMax() for ten random matrices as well.
%We then graph the results. We also display the origi
www.eeworm.com/read/347945/11623365
m mpt_detect_and_improve_bounds.m
function [lb,ub,redundant] = detect_and_improve_bounds(Matrices,lb,ub,binary_var_index,options);
A = [ Matrices.G -Matrices.E];
b = [ Matrices.W ];
[global_lower,global_upper,bound_rows] = find
www.eeworm.com/read/303463/3810177
m mpt_detect_and_improve_bounds.m
function [lb,ub,redundant] = detect_and_improve_bounds(Matrices,lb,ub,binary_var_index,options);
A = [ Matrices.G -Matrices.E];
b = [ Matrices.W ];
[global_lower,global_upper,bound_rows] = find
www.eeworm.com/read/193277/8241844
m mpt_detect_and_improve_bounds.m
function [lb,ub,redundant] = detect_and_improve_bounds(Matrices,lb,ub,binary_var_index,options);
A = [ Matrices.G -Matrices.E];
b = [ Matrices.W ];
[global_lower,global_upper,bound_rows] = find
www.eeworm.com/read/303463/3810184
m mpt_project_on_equality.m
function [Matrices,infeasible] = mpt_project_on_equality(Matrices)
% Projects the whole mp(Q)LP problem on Aeq*U + Beq*x = beq
infeasible = 0;
if length(Matrices.beq) > 0
[ii,jj,kk]=