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

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

About: Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression 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 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. 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. (en)
Title	Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression (en)
skos:prefLabel	Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression Efficient Procedure for Solving Circuit Algebraic-Differential Equations with Modified Sparse LU Factorization Improving Fill-In Suppression (en)
skos:notation	RIV/68407700:21230/11:00183905!RIV12-MSM-21230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP102/10/1665), S, Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Černý, David Dobeš, Josef
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	196758
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00183905
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	algebraic-differential equations; LU factorization; Markowitz criterion (en)
http://linked.open.../riv/klicoveSlovo	LU factorization Markowitz criterion algebraic-differential equations
http://linked.open...ontrolniKodProRIV	[E65D14C1BA41]
http://linked.open...v/mistoKonaniAkce	Linköping
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	2011 20th European Conference on Circuit Theory and Design (ECCTD)
http://linked.open...in/vavai/riv/obor	JA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Symbolic and Semisymbolic Methods for Power and Mechatronic Applications
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Dobeš, Josef Černý, David Biolek, D.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-08-29 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	4 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/ECCTD.2011.6043637
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4577-0618-9
http://localhost/t...ganizacniJednotka	21230

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