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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP102%2F10%2F1665" target="_blank" >GAP102/10/1665: Symbolické a semisymbolické metody pro výkonové a mechatronické aplikace</a><br>

Návaznosti

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

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-1-4577-0618-9

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

689-692

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Linköping

Datum konání akce

29. 8. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—