Bond graphs. II: Causality and singularity
From MaRDI portal
Publication:678882
DOI10.1016/S0166-218X(96)00006-6zbMath0867.05077OpenAlexW2086896516MaRDI QIDQ678882
G. M. Asher, Douglas R. Woodall, John D. Lamb
Publication date: 3 August 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
bond graphsingularitycausalitydiscriminantcausal assignmentMason gain formulaMason's determinant rule
Related Items (6)
Passivity-based control of linear time-invariant systems modelled by bond graph ⋮ A short algorithm to delete singular junctions in bond graphs ⋮ An identity involving 3-regular graphs ⋮ Efficient optimal equation formulation in lumped power-conserving systems ⋮ Bond graphs. I: Acausal equivalence ⋮ Bond graphs. III: Bond graphs and electrical networks
Cites Work
- Bond graphs. I: Acausal equivalence
- How to determine the solvability of bond graph linear junction structures
- A fast, complete method for automatically assigning causality to bond graphs
- Simulation of system models containing zero-order causal paths. I.: Classification of zero-order causal paths
- An identity involving 3-regular graphs
- The mathematical foundations of bond graphs. IV: Matrix representations and causality
- Bond Graph Junction Structures
- Lagrange’s Equations for Complex Bond Graph Systems
- On Representatives of Subsets
- The Properties of Bond Graph Junction Structure Matrices
- The Method of Relaxed Causality in the Bond Graph Analysis of Nonlinear Systems
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
This page was built for publication: Bond graphs. II: Causality and singularity