Lamb, John D.
(1996)
*
A short algorithm to delete singular functions in bond graphs.
*
Journal of the Franklin Institute-Engineering and Applied Mathematics,
333B
(1).
pp. 23-30.
ISSN 0016-0032.
(doi:10.1016/0016-0032(95)00086-0)
(The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
(KAR id:19293)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication) | |

Official URL http://dx.doi.org/10.1016/0016-0032(95)00086-0 |

## Abstract

Singular junctions, singular and nonsingular bond graphs are defined. Singular and nonsingular causal assignments, consistent and inconsistent sets of input variables, and the concept of precausal equivalence are also defined. Nonsingular bond graphs are important because they are precisely the bond graphs in which consistent causal assignments correspond to nonsingular causal assignments. A simple, polynomial time algorithm is described that constructs from a given bond graph a precausally equivalent nonsingular bond graph by deleting a set of singular junctions. This algorithm simplifies modelling and makes it easier to find a set of state space equations.

Item Type: | Article |
---|---|

DOI/Identification number: | 10.1016/0016-0032(95)00086-0 |

Subjects: | Q Science > QA Mathematics (inc Computing science) |

Divisions: | Faculties > Sciences > School of Mathematics Statistics and Actuarial Science |

Depositing User: | R.F. Xu |

Date Deposited: | 04 Jun 2009 16:16 UTC |

Last Modified: | 28 May 2019 13:57 UTC |

Resource URI: | https://kar.kent.ac.uk/id/eprint/19293 (The current URI for this page, for reference purposes) |

- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV

- Depositors only (login required):