On Euclidean Norm Approximations
Numerical Analysis
2010-08-31 v1 Computer Vision and Pattern Recognition
Abstract
Euclidean norm calculations arise frequently in scientific and engineering applications. Several approximations for this norm with differing complexity and accuracy have been proposed in the literature. Earlier approaches were based on minimizing the maximum error. Recently, Seol and Cheun proposed an approximation based on minimizing the average error. In this paper, we first examine these approximations in detail, show that they fit into a single mathematical formulation, and compare their average and maximum errors. We then show that the maximum errors given by Seol and Cheun are significantly optimistic.
Cite
@article{arxiv.1008.4870,
title = {On Euclidean Norm Approximations},
author = {M. Emre Celebi and Fatih Celiker and Hassan A. Kingravi},
journal= {arXiv preprint arXiv:1008.4870},
year = {2010}
}
Comments
9 pages, 1 figure, Pattern Recognition