Update search
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
NARROW
Format
Journal
Type
Date
Availability
1-2 of 2
Keywords: Circuit simulation
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
COMPEL (2019) 38 (5): 1655–1666.
Published: 19 September 2019
.../legalcode Computer-aided design Transient analysis Circuit analysis Power electronic simulation Circuit simulation SQP Time-domain analysis Electronic components always come along with certain tolerances; therefore, worst-case dimensioning of electronic circuits composed...
Journal Articles
A vertex cut algorithm for model order reduction of parasitic resistive networks
Available to Purchase
COMPEL (2012) 31 (6): 1850–1871.
Published: 09 November 2012
... in order to reduce a parasitic resistive network. An undirected graph G=(U, E) is said to be complete if its edge set includes every pair of vertices. © Emerald Group Publishing Limited 2012 Circuit simulation Graph algorithms Model order reduction Parasitic...
