Extension of the normal tree method

DOI10.1002/(SICI)1097-007X(199903/04)27:2%3C241::AID-CTA62%3E3.0.CO;2-8MaRDI QIDQ4244486zbMATH OpenOpenAlexFDO

Authors Gunther Reißig

Publication date 6 October 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-007x(199903/04)27:2%3C241::aid-cta62%3E3.0.co;2-8

zbMATH Keywords

normal tree method

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Analytic circuit theory (94C05)

Recommendations

• Augmented nodal matrices and normal trees
• Unique solvability of linear memoryless networks-A survey
• scientific article; zbMATH DE number 4128828
• Algorithmic remarks on the Nishi-Chua uniqueness criterion for electrical networks containing controlled sources
• Adjoint nullator‐norator networks

Cites work

• A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
• Derivative-explicit differential equations for RLC graphs
• scientific article; zbMATH DE number 50395 (Why is no real title available?)
• scientific article; zbMATH DE number 3510192 (Why is no real title available?)
• scientific article; zbMATH DE number 3559405 (Why is no real title available?)
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Investigating solvability and complexity of linear active networks by means of matroids
• Non-linear non-reciprocal resistive circuits with a structurally unique solution
• On the existence of solutions to linear active networks: A state-space approach
• Some topologico-dynamical properties of linear passive reciprocal networks
• Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
• Systems analysis by graphs and matroids. Structural solvability and controllability
• The A-matrix of linear passive reciprocal networks
• Topological conditions for the solvability of linear active networks
• Topological criteria for nonlinear resistive circuits containing controlled sources to have a unique solution
• Unique solvability and order of complexity of linear networks containing memorylessn-ports
• Uniqueness of solution for nonlinear resistive circuits containing CCCS's or VCVS's whose controlling coefficients are finite

Cited in

(14)

• On extendibility of voltage and current regimes from subnetworks
• Generalized method based on nodal and mesh analysis for computation of time constants of linear circuits
• Explicit ODE reduction of memristive systems
• On generalized inverses of singular matrix pencils
• Qualitative features of matrix pencils and DAEs arising in circuit dynamics
• Unique solvability of linear memoryless networks-A survey
• scientific article; zbMATH DE number 4128828 (Why is no real title available?)
• A step-by-step approach to compute a consistent initialization for the MNA
• Structural analysis of electric circuits and consequences for MNA
• State-space equations of regular and strictly topologically degenerate linear lumped time-invariant networks: the multiport method
• Adjoint nullator‐norator networks
• DAEs in circuit modelling: a survey
• Tractability index of hybrid equations for circuit simulation
• Augmented nodal matrices and normal trees

This page was built for publication: Extension of the normal tree method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4244486)