Abstract
This paper is a sequel to the previous one on enhancing of convergence properties by a proper choice of output variable assignment for sparse equation sets. A new criterion for the output set assignment selection is presented. Two algorithms—one based on dynamic programming and the other on branch and bound techniques—implement this selection criterion. The paper also indicates that the resulting dynamic programming network is a compact structural representation for the equation set and can be used to obtain tearing information for all output set assignments for the equations directly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
