Combinatorial Algorithms in Scientific Computing

157 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant computational savings can be achieved by employing combinatorial techniques. Moreover, the complexity of problems often requires sophisticated combinatorial techniques, and using simple, brute-force techniques may be very inefficient. From the computer science point of view, it is easy to find challenging combinatorial problems to apply or adapt existing theories or develop new techniques for real-world applications. The breadth of this thesis demonstrates the abundance of combinatorial algorithms in scientific computing as a research field. Each of the six chapters of this thesis was motivated by a different application and the solutions employ different solution techniques. Our results, together with the importance of the problems studied, show the impact of our solutions on real-world applications.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD