Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes

DOI10.1007/s11075-019-00745-3OpenAlexW2948901967WikidataQ127755267 ScholiaQ127755267MaRDI QIDQ2173347

Rida T. Farouki, Jeffrey A. Strom

Publication date: 22 April 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00745-3

zbMATH Keywords

Euler characteristiccondition numberpolynomial rootsBernstein basisrandom simplicial complexDescartes' law of signsinterlaced roots

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• The Bernstein polynomial basis: a centennial retrospective
• On the numerical condition of polynomials in Bernstein form
• On the condition of algebraic equations
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• On Prime Divisors of Binomial Coefficients
• On the optimal stability of the Bernstein basis
• Computing Binomial Coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item