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

DOI10.1007/S11075-019-00745-3MaRDI QIDQ2173347zbMATH OpenOpenAlexWikidataFDO

Authors Rida T. Farouki, Jeffrey 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

Bernstein basiscondition numberDescartes' law of signsEuler characteristicinterlaced rootspolynomial rootsrandom simplicial complex

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• Computing Binomial Coefficients
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3936379 (Why is no real title available?)
• scientific article; zbMATH DE number 3970003 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3240705 (Why is no real title available?)
• scientific article; zbMATH DE number 3380631 (Why is no real title available?)
• On Prime Divisors of Binomial Coefficients
• On the condition of algebraic equations
• On the numerical condition of polynomials in Bernstein form
• On the optimal stability of the Bernstein basis
• The Bernstein polynomial basis: a centennial retrospective
• The evaluation of the zeros of ill-conditioned polynomials. I, II

Cited in

(1)

• Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable

This page was built for publication: Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173347)