About: Topology Reduction For Approximate Symbolic Analysis     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The paper deals with an implementation of fast ranking procedure for approximate symbolic analysis based on simplifying the circuit model. The procedure consists of three steps. First, lossless identification of series and parallel connections of two-poles is performed. Second, network elements whose influence on the circuits function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The third step consists in modifying voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model must be checked numerically. A method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one reference frequency point.
  • The paper deals with an implementation of fast ranking procedure for approximate symbolic analysis based on simplifying the circuit model. The procedure consists of three steps. First, lossless identification of series and parallel connections of two-poles is performed. Second, network elements whose influence on the circuits function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The third step consists in modifying voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model must be checked numerically. A method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one reference frequency point. (en)
Title
  • Topology Reduction For Approximate Symbolic Analysis
  • Topology Reduction For Approximate Symbolic Analysis (en)
skos:prefLabel
  • Topology Reduction For Approximate Symbolic Analysis
  • Topology Reduction For Approximate Symbolic Analysis (en)
skos:notation
  • RIV/00216305:26220/10:PU88897!RIV11-GA0-26220___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP102/10/1665), P(OC09016), Z(MSM0021630513)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 293061
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26220/10:PU88897
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Symbolic analysis, circuit reduction, numerical methods, linear circuits. (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [C4496E0D539A]
http://linked.open...v/mistoKonaniAkce
  • Brno
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Proc of EDS10 IMAPS CS International Conference
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Horák, Martin
  • Kolka, Zdeněk
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IMAPS CS
https://schema.org/isbn
  • 978-80-214-4138-5
http://localhost/t...ganizacniJednotka
  • 26220
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software