All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183905" target="_blank" >RIV/68407700:21230/11:00183905 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/ECCTD.2011.6043637" target="_blank" >http://dx.doi.org/10.1109/ECCTD.2011.6043637</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ECCTD.2011.6043637" target="_blank" >10.1109/ECCTD.2011.6043637</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression

  • Original language description

    In the paper, an efficient and reliable algorithm for solving the circuit algebraic-differential equations is characterized first, which is based on a sophisticated arrangement of the Newton interpolation polynomial. For enhancing the efficiency of repeated solutions of linear systems necessary in the Newton-Raphson method, a novel 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 has been performed.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JA - Electronics and optoelectronics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP102%2F10%2F1665" target="_blank" >GAP102/10/1665: Symbolic and Semisymbolic Methods for Power and Mechatronic Applications</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    2011 20th European Conference on Circuit Theory and Design (ECCTD)

  • ISBN

    978-1-4577-0618-9

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    689-692

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Linköping

  • Event date

    Aug 29, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article