Skip to content

two by two det calculation #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
tommok01 wants to merge 2 commits into
base: master
Choose a base branch
from
Open

two by two det calculation #3

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1b9fb89
two by two det calculation
tommok01 Dec 19, 2021
a2d3510
Recursive nxn algorithm for det
tommok01 Dec 20, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions .gitignore
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,7 @@
.devcontainer/
__pycache__/
.pytest_cache/

Scripts
Lib
pyvenv.cfg
17 changes: 16 additions & 1 deletion det.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,4 +12,19 @@ def det(m: np.ndarray) -> float:
:return: Determinant of the matrix
"""

raise NotImplementedError()
if m.shape == (2, 2):
return (m[0][0] * m[1][1]) - (m[0][1] * m[1][0])

# iterate across top column
# for each element in top column multiply by inner matrix determinant
determinant = 0

for index, element in enumerate(m[0]):
innerMatrix = np.delete(m, index, 1)[1:, :]
if (index % 2) == 0:
determinant += element * det(innerMatrix)
else:
determinant -= element * det(innerMatrix)


return determinant