A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis

Popis výsledku v původním jazyce

In the paper, an efficient and reliable algorithm for solving the circuit nonlinear algebraic-differential equations based on a sophisticated arrangement of Newton interpolation polynomial is characterized first. After that, a novel method is introducedfor improving the convergence with four suggested criteria that are being compared. 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.

Název v anglickém jazyce

A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis

Popis výsledku anglicky

In the paper, an efficient and reliable algorithm for solving the circuit nonlinear algebraic-differential equations based on a sophisticated arrangement of Newton interpolation polynomial is characterized first. After that, a novel method is introducedfor improving the convergence with four suggested criteria that are being compared. 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.

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP102%2F10%2F1614" target="_blank" >GAP102/10/1614: Memristivní, memkapacitivní a meminduktivní systémy: základní výzkum, modelování a simulace</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 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip

ISBN

978-1-4577-0170-2

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

416-421

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Kowloon, Hong Kong

Datum konání akce

3. 10. 2011

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

WRD - Celosvětová akce

Kód UT WoS článku

—