Work

Bond graph-based determination of characteristic polynomial of descriptor systems

Year: 2026

Type: article

Abstract: In this paper, it is given a graph-oriented procedure to determine the characteristic polynomial of a descriptor system. The proof relies on the expansion of a matrix’ determinant by means of the permutation group. It is shown that (after factorization) permutation cycles are mapped one-to-one with families in the bond graph. This relationship only holds because of the structured nature of the equations. Gain and order of those families are then used to derive polynomial coefficients. The result applies to the class of structured LTI descriptor systems intrinsically associated with any linear causal bond graph.

Source: Automatica

DOI: 10.1016/j.automatica.2026.113004

Authors: Amine Laaribi, Damien Eberard, Wilfrid Marquis-Favre

Institutions: Lyon 1 Université, École Centrale de Lyon, Centre National de la Recherche Scientifique, Laboratoire Ampère, Institut National des Sciences Appliquées de Lyon

Language: English

Topic: Modeling and Simulation Systems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,760

OpenAlex ID: W7155097391

FWCI:

Cites: 10

Cited by:

Related to: