TBU Publications
Repository of TBU Publications

Polynomial approximation of quasipolynomials based on digital filter design principles

DSpace Repository

Show simple item record


dc.title Polynomial approximation of quasipolynomials based on digital filter design principles en
dc.contributor.author Pekař, Libor
dc.contributor.author Navrátil, Pavel
dc.relation.ispartof Advances in Intelligent Systems and Computing
dc.identifier.issn 2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-3-319-33387-8
dc.identifier.isbn 978-3-319-33389-2
dc.date.issued 2016
utb.relation.volume 466
dc.citation.spage 25
dc.citation.epage 34
dc.event.title 5th Computer Science On-line Conference, CSOC 2016
dc.event.location Prague
utb.event.state-en Czech Republic
utb.event.state-cs Česká republika
dc.event.sdate 2016-04-27
dc.event.edate 2016-04-30
dc.type conferenceObject
dc.language.iso en
dc.publisher Springer Verlag
dc.identifier.doi 10.1007/978-3-319-33389-2_3
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-319-33389-2_3
dc.subject Approximation en
dc.subject Bilinear transformation en
dc.subject Digital filter en
dc.subject MATLAB en
dc.subject Polynomials en
dc.subject Pre-warping en
dc.subject Quasipolynomials en
dc.description.abstract This contribution is aimed at a possible procedure approximating quasipolynomials by polynomials. Quasipolynomials appear in linear time-delay systems description as a natural consequence of the use of the Laplace transform. Due to their infinite root spectra, control system analysis and synthesis based on such quasipolynomial models are usually mathematically heavy. In the light of this fact, there is a natural research endeavor to design a sufficiently accurate yet simple engineeringly acceptable method that approximates them by polynomials preserving basic spectral information. In this paper, such a procedure is presented based on some ideas of discrete-time (digital) filters designing without excessive math. Namely, the particular quasipolynomial is subjected to iterative discretization by means of the bilinear transformation first; consequently, linear and quadratic interpolations are applied to obtain integer powers of the approximating polynomial. Since dominant roots play a decisive role in the spectrum, interpolations are made in their very neighborhood. A simulation example proofs the algorithm efficiency. © Springer International Publishing Switzerland 2016. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1006423
utb.identifier.obdid 43875463
utb.identifier.scopus 2-s2.0-84964758574
utb.identifier.wok 000385788100003
utb.source d-scopus
dc.date.accessioned 2016-07-26T14:58:29Z
dc.date.available 2016-07-26T14:58:29Z
dc.rights.access openAccess
utb.identifier.utb-sysno 87692
utb.contributor.internalauthor Pekař, Libor
utb.contributor.internalauthor Navrátil, Pavel
utb.fulltext.affiliation Libor Pekař and Pavel Navrátil L. Pekař (&) P. Navrátil Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic e-mail: pekar@fai.utb.cz P. Navrátil e-mail: pnavratil@fai.utb.cz
utb.fulltext.dates -
utb.fulltext.sponsorship The work was performed with the financial support by the Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme project No. LO1303 (MSMT-7778/2014) and also by the European Regional Development Fund under the project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089.
Find Full text

Files in this item

Show simple item record