Skip to content
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.

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

Include more matrix algorithms efficiently in C++, including the following #1

Open
DLohmann opened this issue Feb 22, 2019 · 0 comments

Comments

@DLohmann
Copy link
Owner

  • Adding, subtracting, multiplying, and finding the determinant of matrices.

  • Calculating a large power of a matrix, using matrix diagonalization if possible.

  • Multiplying a chain of matrices of different sizes, and finding the most efficient order to multiply them in (see https://practice.geeksforgeeks.org/problems/matrix-chain-multiplication/0)

  • LU factorization

  • Gaussian elimination, with exceptions thrown for undetermined or linearly dependent systems.

  • Algorithm to convert a linearly dependent matrix (or system) to a linearly independent matrix without loss of information (only redundancy.

  • Maybe these algorithms should be written as a C++ STL template so that they can be used with any data type (ie double, int, etc)

  • Use OpenMP or another parallelization library to make these algorithms as efficient as possible.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant