DEVELOPMENTS IN SIGNAL FLOW GRAPHS USED FOR COMPLEX SYSTEM ANALYSIS.

Marius Preda; Fanica Spinel; Horia Andrei; Dan Durghinescu

DEVELOPMENTS IN SIGNAL FLOW GRAPHS USED FOR COMPLEX SYSTEM ANALYSIS.

Marius Preda
, Fanica Spinel
, Horia Andrei
, Dan Durghinescu

Research output: Contribution to journal › Article › peer-review

Abstract

A canonical form of the signal flow graph is defined. For this canonical form a variation theorem is stated and a numerical efficient method for the signal flow graph solving is proposed. With the established CTA algorithm two illustrative examples are solved as well.

Original language	English
Pages (from-to)	265-275
Number of pages	11
Journal	Rev Roum Sci Tech Ser Electrotech Energ
Volume	31
Issue number	3
Publication status	Published - 1 Jul 1986
Externally published	Yes

Cite this

@article{658ad8183bdc410db1badb610f8335aa,

title = "DEVELOPMENTS IN SIGNAL FLOW GRAPHS USED FOR COMPLEX SYSTEM ANALYSIS.",

abstract = "A canonical form of the signal flow graph is defined. For this canonical form a variation theorem is stated and a numerical efficient method for the signal flow graph solving is proposed. With the established CTA algorithm two illustrative examples are solved as well.",

author = "Marius Preda and Fanica Spinel and Horia Andrei and Dan Durghinescu",

year = "1986",

month = jul,

day = "1",

language = "English",

volume = "31",

pages = "265--275",

journal = "Rev Roum Sci Tech Ser Electrotech Energ",

issn = "0035-4066",

number = "3",

}

TY - JOUR

T1 - DEVELOPMENTS IN SIGNAL FLOW GRAPHS USED FOR COMPLEX SYSTEM ANALYSIS.

AU - Preda, Marius

AU - Spinel, Fanica

AU - Andrei, Horia

AU - Durghinescu, Dan

PY - 1986/7/1

Y1 - 1986/7/1

N2 - A canonical form of the signal flow graph is defined. For this canonical form a variation theorem is stated and a numerical efficient method for the signal flow graph solving is proposed. With the established CTA algorithm two illustrative examples are solved as well.

AB - A canonical form of the signal flow graph is defined. For this canonical form a variation theorem is stated and a numerical efficient method for the signal flow graph solving is proposed. With the established CTA algorithm two illustrative examples are solved as well.

M3 - Article

AN - SCOPUS:0022747492

SN - 0035-4066

VL - 31

SP - 265

EP - 275

JO - Rev Roum Sci Tech Ser Electrotech Energ

JF - Rev Roum Sci Tech Ser Electrotech Energ

IS - 3

ER -

DEVELOPMENTS IN SIGNAL FLOW GRAPHS USED FOR COMPLEX SYSTEM ANALYSIS.

Abstract

Fingerprint

Cite this