Stably computing the multiplicity of known roots given leading coefficients.

DOI10.1002/NLA.2275OpenAlexW2993069602WikidataQ114696217 ScholiaQ114696217MaRDI QIDQ5218985FDOQ5218985

Authors: Gregory J. Clark, Joshua Cooper 

Publication date: 6 March 2020

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:312baa24-d028-4734-8497-4e5b31c02e2d

Recommendations

• scientific article; zbMATH DE number 1961370
• scientific article; zbMATH DE number 3888807
• ROOT MULTIPLICITIES AND NUMBER OF NONZERO COEFFICIENTS OF A POLYNOMIAL
• Roots multiplicity without companion matrices
• Bounds on numers of vectors of multiplicities for polynomials which are easy to compute

zbMATH Keywords

spectral hypergraph theorypolynomial root multiplicityproper leading coefficientsstable Vandermonde inversion

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65) Polynomials in general fields (irreducibility, etc.) (12E05)

Cited In (1)

• Applications of the Harary-Sachs theorem for hypergraphs

This page was built for publication: Stably computing the multiplicity of known roots given leading coefficients.

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