Return to search

Numerical solution algorithms in the DLANET program

Several methods to solve a system of linear equations with real and complex coefficients exist. The most popular methods are Gauss-Jordan, L-U Decomposition, Gauss-Seidel, and Matrix Reduction. These methods are utilized to optimize run-time of the DLANET circuit analysis program. As concluded by this study, the Matrix Reduction method which is presently utilized in the DLANET program, results in run-times which are faster than the other solution methods studied in this paper for lower order systems. Similarly, the L-U Decomposition and Gauss-Jordan methods result in faster run-times than the other techniques for higher order systems. Finally, the Gauss-Seidel Iterative method, when incorporated into the DLANET program, has proven to be much slower than the other solution methods considered in this paper.

Identiferoai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/276957
Date January 1989
CreatorsBhalala, Ashesh, 1964-
ContributorsHuelsman, Lawrence P.
PublisherThe University of Arizona.
Source SetsUniversity of Arizona
Languageen_US
Detected LanguageEnglish
Typetext, Thesis-Reproduction (electronic)
RightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.

Page generated in 0.0025 seconds