Extension of the normal tree method
From MaRDI portal
Publication:4244486
DOI<241::AID-CTA62>3.0.CO;2-8 10.1002/(SICI)1097-007X(199903/04)27:2<241::AID-CTA62>3.0.CO;2-8zbMath0921.68004OpenAlexW2169255233MaRDI QIDQ4244486
Publication date: 6 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-007x(199903/04)27:2<241::aid-cta62>3.0.co;2-8
Related Items
Qualitative features of matrix pencils and DAEs arising in circuit dynamics, State-space equations of regular and strictly topologically degenerate linear lumped time-invariant networks: the multiport method, A step-by-step approach to compute a consistent initialization for the MNA, Tractability index of hybrid equations for circuit simulation, EXPLICIT ODE REDUCTION OF MEMRISTIVE SYSTEMS, On generalized inverses of singular matrix pencils, Structural analysis of electric circuits and consequences for MNA, DAEs in Circuit Modelling: A Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Systems analysis by graphs and matroids. Structural solvability and controllability
- The A-matrix of linear passive reciprocal networks
- A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
- Derivative-explicit differential equations for RLC graphs
- Topological criteria for nonlinear resistive circuits containing controlled sources to have a unique solution
- Uniqueness of solution for nonlinear resistive circuits containing CCCS's or VCVS's whose controlling coefficients are finite
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Non-linear non-reciprocal resistive circuits with a structurally unique solution
- Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
- Topological conditions for the solvability of linear active networks
- On the existence of solutions to linear active networks: A state-space approach
- Some topologico-dynamical properties of linear passive reciprocal networks
- Unique solvability and order of complexity of linear networks containing memorylessn-ports
- Investigating solvability and complexity of linear active networks by means of matroids
