About: New Criteria Enhancing Robustness and Efficiency of Solving Systems of Circuit Equations     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
  • A new robust algorithm suppressing possible divergence of the Newton-Raphson method for solving the nonlinear circuit equations is proposed in both static and dynamic domains. For enhancing the efficiency of repeated solutions of linear systems necessary in the Newton-Raphson method, a new modification of the Markowitz criterion is suggested which is compatible with the fast modes of the LU factorization. The modified criterion consists in an estimation of probabilities of the fill-in enlargement. The probabilities are determined for all columns of the system matrix before the LU factorization, where the column probability is calculated as the average value of the probabilities for all the column elements. Finally, the columns are reordered so that first and last should be those with the minimum and maximum probabilities, respectively. As a verification of the proposed algorithm, a comprehensive set of numerical tests is described for circuits chosen from various parts of electronics.
  • A new robust algorithm suppressing possible divergence of the Newton-Raphson method for solving the nonlinear circuit equations is proposed in both static and dynamic domains. For enhancing the efficiency of repeated solutions of linear systems necessary in the Newton-Raphson method, a new modification of the Markowitz criterion is suggested which is compatible with the fast modes of the LU factorization. The modified criterion consists in an estimation of probabilities of the fill-in enlargement. The probabilities are determined for all columns of the system matrix before the LU factorization, where the column probability is calculated as the average value of the probabilities for all the column elements. Finally, the columns are reordered so that first and last should be those with the minimum and maximum probabilities, respectively. As a verification of the proposed algorithm, a comprehensive set of numerical tests is described for circuits chosen from various parts of electronics. (en)
  • Nová kritéria pro zvý1ení robustnosti a úeinnosti oe1ení soustav obvodových rovnic. (cs)
Title
  • New Criteria Enhancing Robustness and Efficiency of Solving Systems of Circuit Equations
  • Nová kritéria pro zvý1ení robustnosti a úeinnosti oe1ení soustav obvodových rovnic (cs)
  • New Criteria Enhancing Robustness and Efficiency of Solving Systems of Circuit Equations (en)
skos:prefLabel
  • New Criteria Enhancing Robustness and Efficiency of Solving Systems of Circuit Equations
  • Nová kritéria pro zvý1ení robustnosti a úeinnosti oe1ení soustav obvodových rovnic (cs)
  • New Criteria Enhancing Robustness and Efficiency of Solving Systems of Circuit Equations (en)
skos:notation
  • RIV/68407700:21230/06:03121535!RIV07-GA0-21230___
http://linked.open.../vavai/riv/strany
  • 1 ; 5
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/05/0277), Z(MSM6840770014)
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
  • 488491
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/06:03121535
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • LU factorization; implicit integration (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [3D10469B47AF]
http://linked.open...v/mistoKonaniAkce
  • Singapore
http://linked.open...i/riv/mistoVydani
  • Piscataway
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 2006 IEEE Asia Pacific Conference on Circuits and Systems
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
  • Dobeš, Josef
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
  • IEEE
https://schema.org/isbn
  • 978-1-4244-0386-8
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
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, 117 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software