Date of Award

Fall 1981

Document Type

Thesis

Department

Electrical & Computer Engineering

Program/Concentration

Computer Engineering

Committee Director

Roland R. Mielke

Committee Member

Leonard J. Tung

Committee Member

Stephen A. Zahorian

Call Number for Print

Special Collections ; LD4331.E53 K45

Abstract

An algorithm for the symbolic analysis of linear, time-invariant, active or passive networks is presented. The algorithm incorporates the best features of earlier numerical and topological methods of symbolic analysis. A hybrid set of equations is formulated for a closed linear graph and arranged in matrix form. A numerical evalu­ation procedure for the determinant of this hybrid matrix results in an efficient method of symbolic analysis. A proof of the algorithm based on determinant evaluation by a permutation product expansion provides insight into relationships with other methods of symbolic analysis. A computer program implementation of the algorithm is described and calculation results showing· the program to be more efficient than other available symbolic network analysis programs are presented. The relationships between the new algorithm and other methods of symbolic analysis are discussed.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/m2p4-4532

Download

Share

COinS