A new a priori ordering method for sparse systems of equations based on an ordered output set

✍ Scribed by Kabekode V. S. Bhat; Bharat Kinariwala

• Publisher: John Wiley and Sons
• Year: 1980
• Tongue: English
• Weight: 585 KB
• Volume: 8
• Category: Article
• ISSN: 0098-9886
• DOI: 10.1002/cta.4490080204

✦ Synopsis

Abstract

In the context of solution to the sparse systems of equations arising in computer‐aided analysis and design of electrical networks using the Gaussian elimination (GE) process it is well‐known that an a priori reordering for equations and unknowns is almost mandatory. In this paper we present a new approach for a priori ordering for the equations and unknowns using the theory of output sets. Our approach yields an ordered output set as the pivot sequence for an associated GE process. Our algorithm is simple and is more general than the existing ones and leads to an s‐minimal GE process. An example is presented for illustrating the algorithm and the computational complexity of the new method has been analysed. Additional work needed in the area is indicated.