A comparison of the average case numerical condition of the power and bernstein polynomial bases
DOI10.1080/00207160108805087zbMATH Open0988.65039OpenAlexW2083022935WikidataQ126245984 ScholiaQ126245984MaRDI QIDQ2752257FDOQ2752257
Authors: Joab R. Winkler
Publication date: 26 June 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805087
Recommendations
numerical examplescondition numberpolynomial rootsBernstein basisnumerical conditionpolynomial basis conversion
Numerical computation of matrix norms, conditioning, scaling (65F35) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cites Work
- On the numerical condition of polynomials in Bernstein form
- On the stability of transformations between power and Bernstein polynomial forms
- Effectively Well-Conditioned Linear Systems
- On the condition of algebraic equations
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- A statistical analysis of the numerical condition of multiple roots of polynomials.
- Condition numbers of a nearly singular simple root of a polynomial
Cited In (4)
This page was built for publication: A comparison of the average case numerical condition of the power and bernstein polynomial bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752257)