2011.90: Reducing the Influence of Tiny Normwise Relative Errors on Performance Profiles
2011.90: Nicholas J. Dingle and Nicholas J. Higham (2011) Reducing the Influence of Tiny Normwise Relative Errors on Performance Profiles.
This is the latest version of this eprint.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
It is a widespread but little-noticed phenomenon that the normwise relative error $\|x-y\| / \|x\|$ of vectors $x$ and $y$ of floating point numbers of the same precision, where $y$ is an approximation to $x$, can be many orders of magnitude smaller than the unit roundoff. We analyze this phenomenon and show that in the $\infty$-norm it happens precisely when $x$ has components of widely varying magnitude and every component of $x$ of largest magnitude agrees with the corresponding component of $y$. Performance profiles are a popular way to compare competing algorithms according to particular measures of performance. We show that performance profiles based on normwise relative errors can give a misleading impression due to the influence of zero or tiny normwise relative errors. We propose a transformation that reduces the influence of these extreme errors in a controlled manner, while preserving the monotonicity of the underlying data and leaving the performance profile unchanged at its left end-point. Numerical examples with both artificial and genuine data illustrate the benefits of the transformation.
|Item Type:||MIMS Preprint|
To appear in ACM Transaction on Mathematical Software
|Uncontrolled Keywords:||normwise relative error, performance profile, floating point arithmetic, forward error, backward error|
|Subjects:||MSC 2000 > 65 Numerical analysis|
|Deposited By:||Nick Higham|
|Deposited On:||08 February 2013|
Available Versions of this Item
- Reducing the Influence of Tiny Normwise Relative Errors on Performance Profiles (deposited 08 February 2013) [Currently Displayed]