๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

How to determine the solvability of bond graph linear junction structures

โœ Scribed by Michel Wlasowski; Francis Lorenz

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
729 KB
Volume
328
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis

A simple rule .for determining the solvability conditions of the linear junction structure equations of a multiport system is presented. This rule is derived from the bond graph representation of the system. The "linear" term concerns the information as well as the power networks, and refers to the laws (i.e. equations) associated with the elements. Part I of the paper deals with power bonds only, while Part II discusses information bonds. Necessary and suficient conditions, based on the loop rule, are given regarding the solvability of linear junction structure equations.

๐Ÿ“œ SIMILAR VOLUMES

A bond graph algorithm to determine the
A bond graph algorithm to determine the equilibrium state of a system
โœ P.C. Breedveld ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 303 KB

An algorithm is presented which enables one to determine the nature of the equilibrium state of a system with constant inputs by direct inspection of its bond graph representation. The algorithm determines whether or not there exists a unique equilibrium state (within a certain region). If not, the