A general algorithm for resequencing equations and finite element meshes is presented. This algorithm incorporates, in a unified form, the most successful resequencing schemes, namely: the Sloan, Gibbs–King (GK) and Gibbs–Poole–Stockmeyer (GPS) algorithms. As well it provides a context within which the development of new algorithms may take place with a minimum of change. It is easily programmed and has been shown to speed up the execution of the original GK algorithm.
No takes yet. Share an insight, caveat, or question.
Souza et al. (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: