VERTEX and Casual Graphs of Linear Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU21525" target="_blank" >RIV/00216305:26220/01:PU21525 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
VERTEX and Casual Graphs of Linear Systems
Original language description
The paper deals with connections between the so-called VERTEX and causal graphs for linear dynamic system optimization with a view to active frequency filters. It is known that a certain class of circuit structures exists whose VERTEX graph can be transformed to separated causal graphs. These systems then offer several degrees of freedom for their optimization. Another class of systems is described by only one causal graph, when at most one degree of freedom is available. VERTEX graphs of a number of syystems can be transformed to the causal graphs only in part: also VERTEX subgraphs are present which cannot be removed. The connections among the variations of individual parameters are then nonlinear, which exacts special optimization procedures.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA102%2F01%2F0432" target="_blank" >GA102/01/0432: Symbolic, semisymbolic and numerical methods of analysis, design and optimization of electrical circuits</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Telecommunications and Signal Processing TSP 2001
ISBN
80-214-1962-8
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
125-128
Publisher name
Institute of Telecommunications, Brno University of Technology
Place of publication
Brno
Event location
Brno
Event date
Sep 5, 2001
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)