{"id":{"repo_id":"rgu","oai_identifier":"oai:rgu-repository.worktribe.com:1993274"},"canonical_url":"https://search.dev.ndltd.org/etd/rgu/oai:rgu-repository.worktribe.com:1993274","repository":{"repo_id":"rgu","name":"Robert Gordon University","base_url":"https://rgu-repository.worktribe.com/oaiprovider"},"display":{"title":"Computer aided analysis of electric circuits using state-variable techniques.","abstract":"There are three main tasks that a computer program based on state-variable analysis must perform: 1) formulation of a degenerate system of equations; 2) processing of these equations until they eventually become the state equations; 3) the solution of the state equations. The first task requires the computation of a topological tree and its associated tie-set matrix. This can be done using either matrix or search methods. Degenerate variables can then be eliminated using Pottle's method or the Auxiliary Trees method, which is based on Bashkow's work. The solution of the state equations can be accomplished using: 1) an Adams-Bashforth-Moulton predictor corrector method; 2) a Runge-Kutta method (e.g. England's method); 3) Certaine's method of transition matrices; 4) methods suitable for use with systems containing equations with widely separated time constants, known as Stiff equations (e.g. Gear's method). It was found that the formulation of the degenerate system of equations was relatively easy to program, but the elimination of degenerate variables from the main system of equations proved more difficult to program. Additionally, the solution of the state equations gave rise to problems that were sometimes difficult to diagnose. Apart from one problem that could not be resolved using Certaine's method, all test networks containing capacitors, resistors, inductors and independent sources were solved. However, test circuits containing linearly-controlled sources failed without exception when a row of the augmented matrix contained all negative elements - this gave rise to transient responses of the right shape, but grossly distorted in magnitude. Program FOFSVM5 was based on Bashkow's topological formulation of the state equations and uses the Auxiliary Tree method of eliminating the degenerate variables from the main system of equations. It is hoped that FOFSVM5 can be used to investigate integrated circuits in future, subject to various improvements.","abstract_html":"There are three main tasks that a computer program based on state-variable analysis must perform: 1) formulation of a degenerate system of equations; 2) processing of these equations until they eventually become the state equations; 3) the solution of the state equations. The first task requires the computation of a topological tree and its associated tie-set matrix. This can be done using either matrix or search methods. Degenerate variables can then be eliminated using Pottle's method or the Auxiliary Trees method, which is based on Bashkow's work. The solution of the state equations can be accomplished using: 1) an Adams-Bashforth-Moulton predictor corrector method; 2) a Runge-Kutta method (e.g. England's method); 3) Certaine's method of transition matrices; 4) methods suitable for use with systems containing equations with widely separated time constants, known as Stiff equations (e.g. Gear's method). It was found that the formulation of the degenerate system of equations was relatively easy to program, but the elimination of degenerate variables from the main system of equations proved more difficult to program. Additionally, the solution of the state equations gave rise to problems that were sometimes difficult to diagnose. Apart from one problem that could not be resolved using Certaine's method, all test networks containing capacitors, resistors, inductors and independent sources were solved. However, test circuits containing linearly-controlled sources failed without exception when a row of the augmented matrix contained all negative elements - this gave rise to transient responses of the right shape, but grossly distorted in magnitude. Program FOFSVM5 was based on Bashkow's topological formulation of the state equations and uses the Auxiliary Tree method of eliminating the degenerate variables from the main system of equations. It is hoped that FOFSVM5 can be used to investigate integrated circuits in future, subject to various improvements.","abstract_has_math":false,"creators":["Abson, Derek S."],"institution":"Robert Gordon's Institute of Technology","degree_name":"PhD","degree_level":"Doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["F.G. McIntosh, E. Forrest, and J. Eades"],"committee_chairs":[],"committee_members":[],"year":1976,"date_issued":"1976","date_published":"1976","updated_at":"2026-07-24T04:10:06Z","subjects":["State-variable analysis","Degenerate system","Adams-Bashforth-Moulton","Topological tree","Tie-set matrix","Pottle's method","Runge-Kutta method","Stiff equations","Auxiliary tree method"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:rgu-repository.worktribe.com:1993274","https://doi.org/10.48526/rgu-wt-1993274"],"render_values":[{"text":"oai:rgu-repository.worktribe.com:1993274","href":null,"code":true},{"text":"https://doi.org/10.48526/rgu-wt-1993274","href":"https://doi.org/10.48526/rgu-wt-1993274","code":true}]}]},"links":{"outbound_url":"https://rgu-repository.worktribe.com/1993274/1/ABSON%201976%20Computer%20aided%20analysis%20of","outbound_label":"Repository record","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["F.G. McIntosh, E. Forrest, and J. Eades"]},{"key":"dc:contributor.sponsor","label":"Sponsor","values":["Scottish Government"]},{"key":"dc:creator","label":"Author","values":["Abson, Derek S."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1976-08-31"]},{"key":"dc:date.issued","label":"Date","values":["1976"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["Robert Gordon's Institute of Technology"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://rgu-repository.worktribe.com/output/1993274"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["State-variable analysis","Degenerate system","Adams-Bashforth-Moulton","Topological tree","Tie-set matrix","Pottle's method","Runge-Kutta method","Stiff equations","Auxiliary tree method"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:rgu-repository.worktribe.com:1993274","https://doi.org/10.48526/rgu-wt-1993274"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://rgu-repository.worktribe.com/1993274/1/ABSON%201976%20Computer%20aided%20analysis%20of"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["There are three main tasks that a computer program based on state-variable analysis must perform: 1) formulation of a degenerate system of equations; 2) processing of these equations until they eventually become the state equations; 3) the solution of the state equations. The first task requires the computation of a topological tree and its associated tie-set matrix. This can be done using either matrix or search methods. Degenerate variables can then be eliminated using Pottle's method or the Auxiliary Trees method, which is based on Bashkow's work. The solution of the state equations can be accomplished using: 1) an Adams-Bashforth-Moulton predictor corrector method; 2) a Runge-Kutta method (e.g. England's method); 3) Certaine's method of transition matrices; 4) methods suitable for use with systems containing equations with widely separated time constants, known as Stiff equations (e.g. Gear's method). It was found that the formulation of the degenerate system of equations was relatively easy to program, but the elimination of degenerate variables from the main system of equations proved more difficult to program. Additionally, the solution of the state equations gave rise to problems that were sometimes difficult to diagnose. Apart from one problem that could not be resolved using Certaine's method, all test networks containing capacitors, resistors, inductors and independent sources were solved. However, test circuits containing linearly-controlled sources failed without exception when a row of the augmented matrix contained all negative elements - this gave rise to transient responses of the right shape, but grossly distorted in magnitude. Program FOFSVM5 was based on Bashkow's topological formulation of the state equations and uses the Auxiliary Tree method of eliminating the degenerate variables from the main system of equations. It is hoped that FOFSVM5 can be used to investigate integrated circuits in future, subject to various improvements."]},{"key":"dc:title","label":"Title","values":["Computer aided analysis of electric circuits using state-variable techniques."]}]}],"canonical_facts":{"dc:contributor.advisor":["F.G. McIntosh, E. Forrest, and J. Eades"],"dc:contributor.sponsor":["Scottish Government"],"dc:creator":["Abson, Derek S."],"dc:date":["1976-08-31"],"dc:date.issued":["1976"],"dc:description.abstract":["There are three main tasks that a computer program based on state-variable analysis must perform: 1) formulation of a degenerate system of equations; 2) processing of these equations until they eventually become the state equations; 3) the solution of the state equations. The first task requires the computation of a topological tree and its associated tie-set matrix. This can be done using either matrix or search methods. Degenerate variables can then be eliminated using Pottle's method or the Auxiliary Trees method, which is based on Bashkow's work. The solution of the state equations can be accomplished using: 1) an Adams-Bashforth-Moulton predictor corrector method; 2) a Runge-Kutta method (e.g. England's method); 3) Certaine's method of transition matrices; 4) methods suitable for use with systems containing equations with widely separated time constants, known as Stiff equations (e.g. Gear's method). It was found that the formulation of the degenerate system of equations was relatively easy to program, but the elimination of degenerate variables from the main system of equations proved more difficult to program. Additionally, the solution of the state equations gave rise to problems that were sometimes difficult to diagnose. Apart from one problem that could not be resolved using Certaine's method, all test networks containing capacitors, resistors, inductors and independent sources were solved. However, test circuits containing linearly-controlled sources failed without exception when a row of the augmented matrix contained all negative elements - this gave rise to transient responses of the right shape, but grossly distorted in magnitude. Program FOFSVM5 was based on Bashkow's topological formulation of the state equations and uses the Auxiliary Tree method of eliminating the degenerate variables from the main system of equations. It is hoped that FOFSVM5 can be used to investigate integrated circuits in future, subject to various improvements."],"dc:identifier":["oai:rgu-repository.worktribe.com:1993274","https://doi.org/10.48526/rgu-wt-1993274"],"dc:identifier.uri":["https://rgu-repository.worktribe.com/1993274/1/ABSON%201976%20Computer%20aided%20analysis%20of"],"dc:language":["en"],"dc:publisher.institution":["Robert Gordon's Institute of Technology"],"dc:relation.isreferencedby":["https://rgu-repository.worktribe.com/output/1993274"],"dc:subject":["State-variable analysis","Degenerate system","Adams-Bashforth-Moulton","Topological tree","Tie-set matrix","Pottle's method","Runge-Kutta method","Stiff equations","Auxiliary tree method"],"dc:title":["Computer aided analysis of electric circuits using state-variable techniques."],"dc:type":["Thesis"],"dc:type.qualificationlevel":["Doctoral"],"dc:type.qualificationname":["PhD"]},"updated_at":"2026-07-24T04:10:06Z"}