Upper and lower bounds of the frequency response gain of sampled-data systems (Q5947645)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1661397
Language Label Description Also known as
default for all languages
No label defined
    English
    Upper and lower bounds of the frequency response gain of sampled-data systems
    scientific article; zbMATH DE number 1661397

      Statements

      Upper and lower bounds of the frequency response gain of sampled-data systems (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      10 April 2002
      0 references
      The authors suggest three independent methods for computing upper and lower bounds of the frequency response gains. The first method is derived with the lifting approach and does not have an approximation parameter. Although this excludes the possibility of adjusting the accuracy, the method quite often gives almost coincident upper and lower bounds in a short computational time. This is particularly useful for the combined use with the bisection algorithm, enabling one to arrive at an exact gain to any degree of accuracy with only numerically reliable computations. The second and the third methods are derived with the FR-operator approach and have an approximation parameter that can be used to improve accuracy at the expense of the computational load. They give not only the lower bound but also the upper bound of the frequency response gain. It has been also clarified that the arguments discussed here have close relationships to the sampled-data \(H_2\) and \(H_\infty\) problems.
      0 references
      sampled-data systems
      0 references
      frequency response
      0 references
      lifting technique
      0 references
      FR-operator
      0 references
      error bounds
      0 references
      gains
      0 references

      Identifiers