Revisiting the stability of computing the roots of a quadratic polynomial
Numerical Analysis
2014-09-30 v1 Numerical Analysis
Abstract
We show in this paper that the roots and of a scalar quadratic polynomial with real or complex coefficients , can be computed in a element-wise mixed stable manner, measured in a relative sense. We also show that this is a stronger property than norm-wise backward stability, but weaker than element-wise backward stability. We finally show that there does not exist any method that can compute the roots in an element-wise backward stable sense, which is also illustrated by some numerical experiments.
Keywords
Cite
@article{arxiv.1409.8072,
title = {Revisiting the stability of computing the roots of a quadratic polynomial},
author = {Mastronardi Nicola and Van Dooren Paul},
journal= {arXiv preprint arXiv:1409.8072},
year = {2014}
}
Comments
13 pages