Working with a set of matrices

2 次查看(过去 30 天)
I want to generate a finite matrix group by starting with the S ={identity} and multiplying by some generators until S no longer grows in size.
Is there an efficient way to deal with a "set" like this, without manualling checking for duplicates? For example, it seems awkward if you use cell arrays to store the elements of S.
  2 个评论
Matt J
Matt J 2021-4-3
For example, it seems awkward if you use cell arrays to store the elements of S.
Why?
Lorcan O'Connor
Lorcan O'Connor 2021-4-3
Well say I multiply everything in the cell array by a matrix and only want to take the new elements, how do I efficiently take a “set Union” (or even check if a matrix is in the array), without just looping and checking everything?

请先登录,再进行评论。

采纳的回答

Matt J
Matt J 2021-4-3
编辑:Matt J 2021-4-3
I'm not sure I will fully understand the task without seeing an example. However, if S is organized as an MxNxP array,
[M,N]=deal(3,3);
S=cat(3,eye(M,N), randi(5,M,N), eye(M,N) )
S =
S(:,:,1) = 1 0 0 0 1 0 0 0 1 S(:,:,2) = 4 5 4 2 1 3 1 5 2 S(:,:,3) = 1 0 0 0 1 0 0 0 1
then you can get rid of duplicate slices with
s=reshape(S,[],size(S,3));
S=reshape( unique(s.','rows').', M,N,[])
S =
S(:,:,1) = 1 0 0 0 1 0 0 0 1 S(:,:,2) = 4 5 4 2 1 3 1 5 2
If S contains non-integer matrices, you will probably need to use uniquetol() instead of unique().

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Creating and Concatenating Matrices 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by