Recursive grid methods to compute value sets and Horowitz–Sidi bounds
✍ Scribed by Per-Olof Gutman; Mattias Nordin; Bnayahu Cohen
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 442 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1049-8923
- DOI
- 10.1002/rnc.1083
No coin nor oath required. For personal study only.
✦ Synopsis
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.