Revisiting the stability of computing the roots of a quadratic polynomial

zbMath1312.65074arXiv1409.8072MaRDI QIDQ2341381

Nicola Mastronardi, Paul Van Dooren

Publication date: 24 April 2015

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.8072

zbMATH Keywords

rootsquadratic polynomialnumerical stabilitynumerical experimentbackward stability

Mathematics Subject Classification ID

Related Items (4)

An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem ⋮ Backward error measures for roots of polynomials ⋮ Min-max elementwise backward error for roots of polynomials and a corresponding backward stable root finder ⋮ Backward error and conditioning of Fiedler companion linearizations

Uses Software

• mctoolbox

This page was built for publication: Revisiting the stability of computing the roots of a quadratic polynomial