2 options
Finding a minimum covering circle based on infinity norms / by Andrew A. Thompson.
Connect to full text Available online
View online- Format:
- Book
- Government document
- Author/Creator:
- Thompson, Andrew A.
- Series:
- ARL-TR (Aberdeen Proving Ground, Md.) ; 4495.
- ARL-TR ; 4495
- Language:
- English
- Subjects (All):
- Algorithms.
- Versification.
- Iterative methods (Mathematics).
- Computer algorithms.
- algorithms.
- Physical Description:
- 1 online resource ([20] pages : illustrations
- Place of Publication:
- Aberdeen Proving Ground, MD : Army Research Laboratory, [2008]
- Summary:
- This report discusses the use of infinity norms to solve the problem of finding the minimum covering radius for a set of points. The minimum covering radius can be used as a measure of the accuracy of a collection of shots or a description of spall fragments. The algorithm worked well for the data sets investigated, sometimes converging in three iterations; however, in some cases, there were hundreds of iterations. For specific metrics, it would be possible to use directional derivatives to improve the convergence of the process. The overall design is based on defining an improvement step to be repeated until the state of the process fulfills a specific criterion. Infinity norms offer a theoretic framework for algorithm development.
- Notes:
- Title from title screen (viewed January 28, 2010).
- "July 2008."
- OCLC:
- 318690428
- Access Restriction:
- APPROVED FOR PUBLIC RELEASE.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.