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

Lower and Upper Triangle Portions of a Sparse Matrix #6

Closed
rizwanashraf opened this issue Jan 21, 2023 · 0 comments
Closed

Lower and Upper Triangle Portions of a Sparse Matrix #6

rizwanashraf opened this issue Jan 21, 2023 · 0 comments
Assignees
Labels
enhancement New feature or request

Comments

@rizwanashraf
Copy link
Collaborator

rizwanashraf commented Jan 21, 2023

Include support for extracting the Lower ($L$) and Upper ($U$) Triangle portions of a Sparse Matrix, i.e., $A = L + U$.

The decomposition includes a strictly lower triangular matrix, i.e., $L_{ij} = [ a_{ij} ~~ for ~~ i > j;~ 0~~ for~~ i <= j ] $, and an upper triangular matrix, i.e., $U_{ij} = [ a_{ij} ~~ for ~~ i <= j;~ 0~~ for~~ i > j ] $.

Currently, sparse matrices are supported and the following storage formats are supported: CSR, COO.

The following is an example of extracting the lower triangular portion of a sparse matrix in COMET DSL:

L[i, j] = read_lowerTri_from_file(0);

The following is an example of extracting the upper triangular portion of a sparse matrix in COMET DSL:

U[i, j] = read_upperTri_from_file(0);
@rizwanashraf rizwanashraf added the enhancement New feature or request label Jan 21, 2023
@rizwanashraf rizwanashraf self-assigned this Jan 21, 2023
rizwanashraf added a commit that referenced this issue Jan 21, 2023
…rtion from a sparse matrix. new test cases added. #6
gkestor pushed a commit that referenced this issue Feb 24, 2023
…rtion from a sparse matrix. new test cases added. #6
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant