Abstract
Numerical matrix methods are increasingly popular for polynomial root-finding. This approach usually amounts to the application of the QR algorithm to the highly structured Frobenius companion matrix of the input polynomial. The structure, however, is routinely destroyed already in the first iteration steps. To accelerate this approach, we exploit the matrix structure of the Frobenius and generalized companion matrices, employ various known and novel techniques for eigen-solving and polynomial root-finding, and in addition to the Frobenius input allow other highly structured generalized companion matrices. Employing polynomial root-finders for eigen-solving is a harder task because of the potential numerical stability problems, but we found some new promising directions, particularly for sparse and/or structured input matrices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
