About: Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero Analysis

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

About: Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero 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	The pole-zero analysis is generally known to be very sensitive to the numerical precision of the computer arithmetic. In the paper, various methods are suggested for solving that problem. First, an optimal pivoting strategy of the algorithm that reduces the general eigenvalue problem to the standard one is presented for both full- and sparse-matrix procedures. The algorithm increases the precision of the semisymbolic analysis. A new technique has also been incorporated recognizing multiple poles or zeros, which are often computed inaccurately by the standard algorithms. A novel type of this procedure called secondary root polishing is described in a detailed way. The accuracy is further increased using longer numerical data. First, the long double precision is utilized. Furthermore, a novel application of a suitable multiple-precision arithmetic library is suggested. Finally, using the longer numerical data to eliminate possible imprecision of the multiple eigenvalues is evaluated. The pole-zero analysis is generally known to be very sensitive to the numerical precision of the computer arithmetic. In the paper, various methods are suggested for solving that problem. First, an optimal pivoting strategy of the algorithm that reduces the general eigenvalue problem to the standard one is presented for both full- and sparse-matrix procedures. The algorithm increases the precision of the semisymbolic analysis. A new technique has also been incorporated recognizing multiple poles or zeros, which are often computed inaccurately by the standard algorithms. A novel type of this procedure called secondary root polishing is described in a detailed way. The accuracy is further increased using longer numerical data. First, the long double precision is utilized. Furthermore, a novel application of a suitable multiple-precision arithmetic library is suggested. Finally, using the longer numerical data to eliminate possible imprecision of the multiple eigenvalues is evaluated. (en)
Title	Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero Analysis Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero Analysis (en)
skos:prefLabel	Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero Analysis Accurate Procedures of the Sparse-Matrix Deflation for Circuit Pole-Zero Analysis (en)
skos:notation	RIV/68407700:21230/11:00183907!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	184426
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00183907
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	eigenvalues and eigenfunctions; poles and zeros; sparse matrices; variable-length arithmetic; transmission lines (en)
http://linked.open.../riv/klicoveSlovo	eigenvalues and eigenfunctions poles and zeros sparse matrices transmission lines variable-length arithmetic
http://linked.open...ontrolniKodProRIV	[07A50613379E]
http://linked.open...v/mistoKonaniAkce	Livingstone
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	IEEE Africon 2011
http://linked.open...in/vavai/riv/obor	JA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (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	Biolková, V. Dobeš, Josef Kolka, Z. Míchal, J. Černý, David
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-09-13 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
issn	2153-0025
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-61284-993-5
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