Skip to content
/ Benders-Minimum-Fill Public

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..

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

abadithela/Benders-Minimum-Fill

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
ASP_input.m
ASP_input.m
 
 
GetNextCombination.m
GetNextCombination.m
 
 
README.md
README.md
 
 
bmf_chordless_cycles.m
bmf_chordless_cycles.m
 
 
bmf_clingo.m
bmf_clingo.m
 
 
clingo_ischordal.m
clingo_ischordal.m
 
 
clingotest.m
clingotest.m
 
 
fillMatrix.m
fillMatrix.m
 
 
flopcount.m
flopcount.m
 
 
plot_spy.m
plot_spy.m
 
 

Repository files navigation

Benders-Minimum-Fill

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.

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

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages