For a given sparse symmetric indefinite matrix, this algorithm returns a minimum fill-in reducing permutation matrix for pre-ordering the matrix prior to LDL' factorization.
-
Notifications
You must be signed in to change notification settings - Fork 0
abadithela/Benders-Minimum-Fill
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
For a given sparse symmetric indefinite matrix, this algorithm returns a minimum fill-in reducing permutation matrix for pre-ordering the matrix prior to LDL' factorization..
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published