All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Polynomial approximation of quasipolynomials based on digital filter design principles

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F16%3A43874809" target="_blank" >RIV/70883521:28140/16:43874809 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-33389-2_3" target="_blank" >http://dx.doi.org/10.1007/978-3-319-33389-2_3</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-33389-2_3" target="_blank" >10.1007/978-3-319-33389-2_3</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Polynomial approximation of quasipolynomials based on digital filter design principles

  • Original language description

    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 synthe-sis 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BC - Theory and management systems

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Automation Control Theory Perspectives in Intelligent Systems: Proceedings of the 5th computer science on-line conference 2016. Vol. 3

  • ISBN

    978-3-319-33387-8

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    25-34

  • Publisher name

    Springer-Verlag Berlin

  • Place of publication

    Heidelberg

  • Event location

    on-line

  • Event date

    Apr 27, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000385788100003