Criteria for stability of zeros of sampled systems
Mitsuaki Ishitobi
Abstract
Mitsuaki Ishitobi
Abstract
Simplified forms of criteria are presented for ensuring that all zeros of a discrete system are stable when a continuous-time and strictly proper plant is discretised by the use of a sampler and a zero-order holder. The Nyquist algorithm proposed by Fu and Dumont (1989) has been improved in the sense that a point of the Nyquist curve is obtained analytically. When a lowpass system is sampled, analytical forms of criteria without drawing the Nyquist curves have been also shown.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Simplified forms of criteria are presented for ensuring that all zeros of a discrete system are stable when a continuous-time and strictly proper plant is discretised by the use of a sampler and a zero-order holder. The Nyquist algorithm proposed by Fu and Dumont (1989) has been improved in the sense that a point of the Nyquist curve is obtained analytically. When a lowpass system is sampled, analytical forms of criteria without drawing the Nyquist curves have been also shown.
Key concepts: Nyquist–Shannon sampling theorem, Nyquist plot, Nyquist stability criterion, Control theory (sociology), Mathematics, Stability (learning theory), Nyquist frequency, Small-gain theorem