dc.identifier.uri |
http://dx.doi.org/10.15488/572 |
|
dc.identifier.uri |
http://www.repo.uni-hannover.de/handle/123456789/596 |
|
dc.contributor.author |
Radić-Weissenfeld, Ljubica J.
|
|
dc.contributor.author |
Ludwig, Stefan
|
|
dc.contributor.author |
Mathis, Wolfgang
|
|
dc.date.accessioned |
2016-10-31T07:59:00Z |
|
dc.date.available |
2016-10-31T07:59:00Z |
|
dc.date.issued |
2009 |
|
dc.identifier.citation |
Radić-Weissenfeld, L.J.; Ludwig, S.; Mathis, W.: Comparison of order reduction algorithms for application to electrical networks. In: Advances in Radio Science 7 (2009), S 119-122. DOI: http://dx.doi.org/10.5194/ars-7-119-2009 |
|
dc.description.abstract |
This paper addresses issues related to the minimization of the computational burden in terms of both memory and speed during the simulation of electrical models. In order to achieve a simple and computational fast model the order reduction of its reducible part is proposed. In this paper the overview of the order reduction algorithms and their application are discussed. |
eng |
dc.description.sponsorship |
MEDEA+/A701 PARACHUTE |
|
dc.description.sponsorship |
BMBF/01M 3169 A |
|
dc.description.sponsorship |
BMBF/01M 3169 D |
|
dc.description.sponsorship |
BMBF/01M 3169 E |
|
dc.language.iso |
eng |
|
dc.publisher |
Göttingen : Copernicus GmbH |
|
dc.relation.ispartofseries |
Advances in Radio Science 7 (2009) |
|
dc.rights |
CC BY 3.0 Unported |
|
dc.rights.uri |
http://creativecommons.org/licenses/by/3.0/ |
|
dc.subject |
Computational burden |
eng |
dc.subject |
Electrical models |
eng |
dc.subject |
Electrical networks |
eng |
dc.subject |
FAST model |
eng |
dc.subject |
Order reduction |
eng |
dc.subject |
Computer simulation |
eng |
dc.subject |
Algorithms |
eng |
dc.subject.ddc |
600 | Technik
|
ger |
dc.title |
Comparison of order reduction algorithms for application to electrical networks |
eng |
dc.type |
Article |
|
dc.type |
Text |
|
dc.relation.issn |
1684-9965 |
|
dc.relation.doi |
http://dx.doi.org/10.5194/ars-7-119-2009 |
|
dc.bibliographicCitation.volume |
7 |
|
dc.bibliographicCitation.firstPage |
119 |
|
dc.bibliographicCitation.lastPage |
122 |
|
dc.description.version |
publishedVersion |
|
tib.accessRights |
frei zug�nglich |
|