You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As i was inspecting the codebase i found an implementation of sloan oredering which has description of ordering the adjacency to reduce bandwidth, profile ,wavefront ,fill in properties which are particulary useful for sparse matrix computations and finite element analysis, but only bandwidth property is calculated but there is no implementation of profile,wavefront and fill in properties which are also useful for storage optimisations. Right? Sloan ordering aims to minimize all these properties, but they're not perfectly correlated. A low bandwidth doesn't guarantee low fill-in. Therefore calculations for all these properties should be implemented. right? I am open to discuss on this topic
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
Uh oh!
There was an error while loading. Please reload this page.
-
As i was inspecting the codebase i found an implementation of sloan oredering which has description of ordering the adjacency to reduce bandwidth, profile ,wavefront ,fill in properties which are particulary useful for sparse matrix computations and finite element analysis, but only bandwidth property is calculated but there is no implementation of profile,wavefront and fill in properties which are also useful for storage optimisations. Right? Sloan ordering aims to minimize all these properties, but they're not perfectly correlated. A low bandwidth doesn't guarantee low fill-in. Therefore calculations for all these properties should be implemented. right? I am open to discuss on this topic
Beta Was this translation helpful? Give feedback.
All reactions