✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, two methods for calculating all stabilizing gains for discrete-time systems are given.
📊
Key Findings & Data:The first method focuses on converting the problem using a bilinear transformation and then applying a previously developed theorem for continuous time systems.
💡
Conclusion & Impact:The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Bilinear Transformation · Nyquist’s Criterion · Chebyshev Polynomials
Abstract
In this paper, two methods for calculating all stabilizing gains for discrete-time systems are given. The first method focuses on converting the problem using a bilinear transformation and then applying a previously developed theorem for continuous time systems. Unlike previous results, the method introduced here does not use the Generalised Hermite-Biehler Theorem and therefore provides a computational advantage. The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem
🔖
Cite This Article
BAYHAN, N., SÖYLEMEZ, M. T. (2012). FAST CALCULATION OF ALL STABILIZING GAINS FOR DISCRETE-TIME SYSTEMS. Electrica, Cilt: 6 Sayı: 1, 19–26. https://ajindex.com/articles/1017615