Evaluating the gain of a flow graph by the Grassmann algebra

DOI10.1080/00207178408933249zbMath0563.90039OpenAlexW2087314085MaRDI QIDQ3677473

No author found.

Publication date: 1984

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207178408933249

zbMATH Keywords

composite systemGrassmann algebragain of a flow graphoverall symbolic transfer function

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Grassmann algebra and bond-graph modelling ⋮ A generalization of Lin's method for polynomial factorization

Cites Work

• Unnamed Item
• A unified approach to deadbeat systems design
• Multilinear algebra. 2nd ed
• The product matrices and new gain formulas
• Symbolic network analysis-An algebraic formulation
• A new signal flowgraph formulation of symbolic network functions

This page was built for publication: Evaluating the gain of a flow graph by the Grassmann algebra