Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I think this is what was intended by the trello card "implement determinants".
Not the most efficient algorithm, but most of our transformations are of low dimension and the cost of converting to a more efficient data structure seems to out weigh the benefits, fro example the following implementation is about 4X slower on 4 x 4 matrices when taking into account the time needed to convert to Data.Vectors. Additionally, something like an LU decomposition seems like overkill.
It is also possible that
matrixRep
or something like it can be used instead of the definitions ofonBasis
in the individual vector spaces, e.g.R2
,R3
.