Premium
Recursive grid methods to compute value sets and Horowitz–Sidi bounds
Author(s) -
Gutman PerOlof,
Nordin Mattias,
Cohen Bnayahu
Publication year - 2006
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1083
Subject(s) - grid , equidistant , value (mathematics) , set (abstract data type) , algorithm , perspective (graphical) , mathematics , computer science , mathematical optimization , geometry , statistics , programming language
Abstract In this paper, recursive extensions to the standard equidistant grid method are proposed whereby the gridding is adapted locally such that a prescribed distance is achieved between neighbouring points in the computed value set (template). Also presented is the Prune algorithm, which finds the outer border of a value set defined by a set of points whose nearest neighbour lies within a prescribed distance. The Prune algorithm is part of the recursive grid methods, but can also be used independently with other methods to compute value sets. As an alternative to analytical or search algorithms, a recursive grid algorithm is presented to compute Horowitz–Sidi bounds (QFT bounds, or boundaries). Isaac Horowitz's contribution to computational methods for QFT is outlined in the perspective of the presented algorithms. Copyright © 2006 John Wiley & Sons, Ltd.