Efficient algorithm for computing QFT bounds

This article presents an efficient algorithm for computing quantitative feedback theory (QFT) bounds for frequency-domain specifications from plant templates which are approximated by a finite number of points. To develop the algorithm, an efficient procedure is developed for testing, at a given frequency, whether or not a complex point lies in the QFT bound. This test procedure is then utilised along with a pivoting procedure to trace out, with a prescribed accuracy or resolution, the boundary of the QFT bound. The developed algorithm for computing QFT bounds has the advantages that it is efficient and can compute QFT bounds with multi-valued boundaries. A numerical example is given to show the computational superiority of the proposed algorithm.