Back to Search

Journal article

On the stability of computing polynomial roots via confederate linearizations

Abstract:: A common way of computing the roots of a polynomial is to find the eigenvalues of a linearization, such as the companion (when the polynomial is expressed in the monomial basis), colleague (Chebyshev basis) or comrade matrix (general orthogonal polynomial basis). For the monomial case, many studies exist on the stability of linearization-based rootfinding algorithms. By contrast, little seems to be known for other polynomial bases. This paper studies the stab...
Expand abstract
Collapse abstract

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Nakatsukasa, Y., & Noferini, V. (2015). On the stability of computing polynomial roots via confederate linearizations. Mathematics of Computation, 85(301), 2391–2425.

MLA Style

Nakatsukasa, Y., and V. Noferini. “On the Stability of Computing Polynomial Roots via Confederate Linearizations.” Mathematics of Computation, vol. 85, no. 301, American Mathematical Society, 2015, pp. 2391–425.

Chicago Style

Nakatsukasa, Y, and V Noferini. 2015. “On the Stability of Computing Polynomial Roots via Confederate Linearizations.” Mathematics of Computation 85 (301): 2391–2425.
Tweet
Print

Access Document

Files:: MCOM3049red_nored.pdf

(Accepted manuscript, pdf, 508.3KB)

Publisher copy:: 10.1090/mcom3049

Authors

+ Nakatsukasa, Y More by this author

Institution:

University of Oxford

Division:

MPLS

Department:

Mathematical Institute

Oxford college:

Christ Church

Role:

Author

+ Noferini, V More by this author

Role:

Author

Bibliographic Details

Publisher:: American Mathematical Society Publisher's website
Journal:: Mathematics of Computation Journal website
Volume:: 85
Issue:: 301
Pages:: 2391-2425
Publication date:: 2015-11-10
DOI:: 10.1090/mcom3049
EISSN:: 1088-6842
ISSN:: 0025-5718

Item Description

Language:: English
Keywords:: SBTMR
Pubs id:: pubs:993756
UUID:: uuid:04f4a2f0-eef0-498f-a247-a41eb0fb55b3
Local pid:: pubs:993756
Source identifiers:: 993756
Deposit date:: 2019-04-23

Terms of use

Copyright holder:: American Mathematical Society
Copyright date:: 2015
Notes:: © 2015 American Mathematical Society. This is the accepted manuscript version of the article. The final version is available online from American Mathematical Society at: https://doi.org/10.1090/mcom3049

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP