Show simple item record

dc.contributor.authorDobes, J.
dc.contributor.authorMichal, J.
dc.date.accessioned2016-04-28T06:18:56Z
dc.date.available2016-04-28T06:18:56Z
dc.date.issued2003-09cs
dc.identifier.citationRadioengineering. 2003, vol. 12, č. 3, s. 1-5. ISSN 1210-2512cs
dc.identifier.issn1210-2512
dc.identifier.urihttp://hdl.handle.net/11012/58099
dc.description.abstractIn the paper, a reduction algorithm for transforming the general eigenvalue problem to the standard one is presented for both classical full-matrix methods and a sparse-matrix technique appropriate for large-scale circuits. An optimal pivoting strategy for the two methods is proposed to increase the precision of the computations. The accuracy of the algorithms is furthermore increased using longer numerical data. First, a ORQJ.GRXEOH precision sparse algorithm is compared with the GRXEOH precision sparse and full-matrix ones. Finally, the application of a suitable multiple-precision arithmetic library is evaluated.en
dc.formattextcs
dc.format.extent1-5cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherSpolečnost pro radioelektronické inženýrstvícs
dc.relation.ispartofRadioengineeringcs
dc.relation.urihttp://www.radioeng.cz/fulltexts/2003/03_03_01_05.pdfcs
dc.rightsCreative Commons Attribution 3.0 Unported Licenseen
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/en
dc.subjectPoles-zeros analysisen
dc.subjectsparse-matrix reductionen
dc.subjectgeneral eigenvalue problemen
dc.subjectmultiple-precision arithmeticen
dc.titleUsing the Variable-Length Arithmetic for an Accurate Poles-Zeros Analysisen
eprints.affiliatedInstitution.facultyFakulta eletrotechniky a komunikačních technologiícs
dc.coverage.issue3cs
dc.coverage.volume12cs
dc.rights.accessopenAccessen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 3.0 Unported License
Except where otherwise noted, this item's license is described as Creative Commons Attribution 3.0 Unported License