Develop #96
Merged
Develop #96
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- Also pulled up some methods from the sparse vector class into the RealSparseTensorBase class.
…on in the complex plane.
Check for positive definiteness is now done in while computing decomposition and should add a significant performance boost when checking for positive definiteness.
…rages the Cholesky decomposition.
…ntations have been renamed and marked as deprecated.
…t double shift QR algorithm.
This new implementation fixed some old correctness issues as well as provides a significant performance increase as iterations of the QR algorithm were brought from O(n^3) to O(n^2).
Sonar no longer supports Java 11 for its runtime environment. Upgrade to Java 17.
Sparse matrices - QR, Hessenburg, Schur decompositions - Tensor solver.
This new implementation fixed some old correctness issues as well as provides a significant performance increase as iterations of the QR algorithm were brought from O(n^3) to O(n^2).
…lity class Invert.java must now be used.
Eigenvector
…sor, matrix, or vector the utility classes in org.flag4j.linalg
Remove norm methods from matrix classes. To compute the norm of a ten…
…sor, matrix, or vector the utility classes in org.flag4j.linalg
…rly uphold the expected contract with the Object.hashcode method. - Specifically, the equals method now returns false if the passed argument is not the same type as the instance for which the method was called on. - The old behaviour is not implemented through the TensorBase.tensorEquals method. This method accepts any tensor (i.e. matrix, sparse matrix, vector tensor, complex matrix, etc.) and checks for equality by treating all objects as tensors. That is, two tensors (including matrices and vectors) are considered equal if they have the same shape and are element-wise equal. So, a matrix with shape (8, 92) will be equal to a sparse tensor of shape (8, 92) if all values in the two objects are element-wise equal.
…ar matrix inversion calculation.
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Added many sparse matrix algorithm implementations, fixed many bugs, and added tests.