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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A more efficient arrangement of the sparse LU factorization for the large-scale circuit 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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 introduced for 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. 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 introduced for 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. (en)
Title	A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis (en)
skos:prefLabel	A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis (en)
skos:notation	RIV/68407700:21230/11:00184428!RIV12-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP102/10/1614), S, Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Černý, David Dobeš, Josef Yadav, Abhimanyu
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	183906
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00184428
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Algorithm design and analysis; Finite wordlength effects; Interpolation; Polynomials; Transient analysis; Vectors (en)
http://linked.open.../riv/klicoveSlovo	Algorithm design and analysis Finite wordlength effects Interpolation Polynomials Transient analysis Vectors
http://linked.open...ontrolniKodProRIV	[255211E6171F]
http://linked.open...v/mistoKonaniAkce	Kowloon, Hong Kong
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip
http://linked.open...in/vavai/riv/obor	JA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Memristive, memcapacitative, and meminductive systems: basic research, modeling, and simulation
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Dobeš, Josef Yadav, Abhimanyu Černý, David
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-10-03 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/VLSISoC.2011.6081619
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4577-0170-2
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software