Approaching the problem from a slightly different angle, one can first transform a permutation vector p into a permutation matrix, for instance: julia> function MP(p) ℓ = length(p) vcat([ begin t=reshape(repeat([0], ℓ), 1, ℓ); t[i]=1; t; end for i in p ]...) end MP (gen…

[image] mikmoore: Although the permutation should be inverse-applied (i.e., with its transpose) on one side or the other if it’s actually to be treated as a permutation matrix, which would make this a bit more complicated. Yes, the getindex should be Base.getindex(P::PermutationMatrix, i::In…

Constructing a permutation matrix

General Usage

Dan May 22, 2025, 6:43pm 10

This package:

is neglected, but has the same ideas (matrix form, cycle counts, sparse form). Perhaps it can be alived.

3 Likes

Topic		Replies	Views
LU Decomposition - return permutation matrix instead of vector New to Julia question , linearalgebra	7	1361	June 20, 2020
Matrix permanent Performance	7	1467	May 7, 2018
Linear Algebra tricks? General Usage	28	1949	May 4, 2020
Multiplication after transpose much faster than multiplication after PermutedDimsArray Performance linearalgebra	3	1660	April 10, 2019
Speed up matrix multiplication with permuted vector Performance linearalgebra , sparse	5	959	September 1, 2021

Constructing a permutation matrix

Related topics