Papers
Topics
Authors
Recent
Search
2000 character limit reached

Revisiting the stability of computing the roots of a quadratic polynomial

Published 29 Sep 2014 in math.NA and cs.NA | (1409.8072v1)

Abstract: We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ 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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.