| << Chapter < Page | Chapter >> Page > |
colcopyi.m
function y = colcopyi(v,n) treats row or column
vector
v as a column vector, reverses the order of the elements, and makes a
matrix with
n columns of the reversed vector.
function y = colcopyi(v,n)
% COLCOPYI y = colcopyi(v,n) n columns in reverse order% Version of 8/22/96
% v a row or column vector.% Treats v as column vector,
% reverses the order of the% elements, and makes n copies.
% Procedure based on "Tony's trick"N = ones(1,n);
[r,c]= size(v);
if r == 1v = v(c:-1:1)';
elsev = v(r:-1:1);
endy = v(:,N);
rowcopy.m
function y = rowcopy(v,n) treats row or column vector
v as a row vector and makes a matrix with
n rows of
v .
function y = rowcopy(v,n)
% ROWCOPY y = rowcopy(v,n) n rows of v% Version of 5/7/96
% v a row or column vector% Treats v as row vector
% and makes n copies% Procedure based on "Tony's trick"
[r,c]= size(v);
if c == 1v = v';
endy = v(ones(1,n),:);
repseq.m
function y = repseq(V,n) replicates vector
V
n times—horizontally if
V is a row vector and vertically if
V is a column vector.
function y = repseq(V,n);
% REPSEQ y = repseq(V,n) Replicates vector V n times% Version of 3/27/97
% n replications of vector V% Horizontally if V a row vector
% Vertically if V a column vectorm = length(V);
s = rem(0:n*m-1,m)+1;y = V(s);
total.m Total of all elements in a matrix, calculated by:
total(x) = sum(sum(x)) .
function y = total(x)
% TOTAL y = total(x)% Version of 8/1/93
% Total of all elements in matrix x.y = sum(sum(x)); dispv.m Matrices are transposed and displayed side by side.
function y = dispv(A,B)
% DISPV y = dispv(A,B) Transpose of A, B side by side% Version of 5/3/96
% A, B are matrices of the same size% They are transposed and displayed
% side by side.y = [A;B]';
roundn.m
function y = roundn(A,n) rounds matrix
A to
n decimal places.
function y = roundn(A,n);
% ROUNDN y = roundn(A,n)% Version of 7/28/97
% Rounds matrix A to n decimalsy = round(A*10^n)/10^n;
arrep.m
function y = arrep(n,k) forms all arrangements, with
repetition, of
k elements from the sequence
.
function y = arrep(n,k);
% ARREP y = arrep(n,k);% Version of 7/28/97
% Computes all arrangements of k elements of 1:n,% with repetition allowed. k may be greater than n.
% If only one input argument n, then k = n.% To get arrangements of column vector V, use
% V(arrep(length(V),k)).N = 1:n;
if nargin == 1k = n;
endy = zeros(k,n^k);
for i = 1:ky(i,:) = rep(elrep(N,1,n^(k-i)),1,n^(i-1));
end The analysis of logical combinations of events (as sets) is systematized by the use of the minterm expansion. This leads naturally to the notion of minterm vectors. These arezero-one vectors which can be combined by logical operations. Production of the basic minterm patterns is essential to a number of operations. The following m-programs arekey elements of various other programs.
minterm.m
function y = minterm(n,k) generates the
k th minterm
vector in a class of
n .
function y = minterm(n,k)
% MINTERM y = minterm(n,k) kth minterm of class of n% Version of 5/5/96
% Generates the kth minterm vector in a class of n% Uses m-function rep
y = rep([zeros(1,2^(n-k)) ones(1,2^(n-k))],1,2^(k-1)); 
Notification Switch
Would you like to follow the 'Applied probability' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|