Research and Implementation of Hungarian Method Based on the Structure Index Reduction for DAE Systems. Issue 2 (June 2014)

• Record Type: Journal Article
• Authors: Zeng, Yan; Wu, Xuesong; Cao, Jianwen
• Is Part Of: Journal of algorithms & computational technology. Volume 8:Issue 2(2014)
• Page Start: 219
• Page End: 231
• Publication Date: 2014-06
• Subjects: DAE -- Index Reduction -- Combinatorial Relaxation Theory -- Bipartite Graph -- Hungarian Method; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1260/1748-3018.8.2.219
• Languages: English
• ISSNs: 1748-3018

Abstract

Hungarian method is a classical method for solving assignment problems. It also can be widely used in other problems, such as matching problem. This paper researches its application on using structural index reduction method to solve high-index DAEs, based on the combinatorial relaxation theory. Combinatorial relaxation theory converts the complex mathematical problem to the matching problem of bipartite graph. Based on this theory this paper presents the main idea of Hungarian method and puts up three implementations for Hungarian method. At last, it compares the time performance of the three implementations by running a set of experiments.