Numerical Algorithms

, Volume 65, Issue 3, pp 447–464 | Cite as

Stability of rootfinding for barycentric Lagrange interpolants

Original Paper
First Online:
Received:
Accepted:

Abstract

Computing the roots of a univariate polynomial can be reduced to computing the eigenvalues of an associated companion matrix. For the monomial basis, these computations have been shown to be numerically stable under certain conditions. However, for certain applications, polynomials are more naturally expressed in other bases, such as the Lagrange basis or orthogonal polynomial bases. For the Lagrange basis, the equivalent stability results have not been published. We show that computing the roots of a polynomial expressed in barycentric form via the eigenvalues of an associated companion matrix pair is numerically stable, and give a bound for the backward error. Numerical experiments show that the error bound is approximately an order of magnitude larger than the backward error. We also discuss the matter of scaling and balancing the companion matrix to bring it closer to a normal pair. With balancing, we are able to produce roots with small backward error.

Keywords

Stability Backward error Lagrange interpolation Barycentric formula Generalized companion matrices Polynomial roots Eigenvalue problem 

Mathematics Subject Classification (2010)

65H04 65H17 65F15 65D05 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amiraslani, A., Corless, R.M., Gonzalez-Vega, L., Shakoori, A.: Polynomial Algebra by Values. Tech. Rep. TR-04-01, Ontario Research Centre for Computer Algebra (2004). http://www.orcca.on.ca/TechReports
  2. 2.
    Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. SIAM, Philadelphia (1999)CrossRefGoogle Scholar
  3. 3.
    Arnold, V.I.: On matrices depending on parameters. Russ. Math. Surv. 26, 29–43 (1971)CrossRefGoogle Scholar
  4. 4.
    Berrut, J.-P.: Rational functions for guaranteed and experimentally well-conditioned global interpolation. Comput. Math. Appl. 15, 1–16 (1988)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Berrut, J.-P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46, 501–517 (2004)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Corless, R.M.: Generalized companion matrices in the Lagrange basis. In: Gonzalez-Vega, L., Recio, T. (eds.) Proceedings EACA, pp. 317–322 (2004)Google Scholar
  7. 7.
    Corless, R.M.: On a generalized companion matrix pencil for matrix polynomials expressed in the lagrange basis. In: Wang, D., Zhi, L. (eds.) Symbolic-Numeric Computation, pp. 1–15. Trends in Mathematics, Birkhäuser Basel (2007)Google Scholar
  8. 8.
    Corless, R.M., Watt, S.M.: Bernstein bases are optimal, but, sometimes, Lagrange bases are better. In: Proceedings of SYNASC, pp. 141–153. MIRTON, Timisoara (2004)Google Scholar
  9. 9.
    Day, D., Romero, L.: Roots of polynomials expressed in terms of orthogonal polynomials. SIAM J. Numer. Anal. 43, 1969 (2005)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Edelman, A., Murakami, H.: Polynomial roots from companion matrix eigenvalues. Math. Comput. 64, 763–776 (1995)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Elsner, L., Rózsa, P.: On eigenvectors and adjoints of modified matrices. Linear Multilinear Algebra 10, 235–247 (1981)CrossRefMATHGoogle Scholar
  12. 12.
    Golberg, M.: The derivative of a determinant. Am. Math. Mon. 79, 1124–1126 (1972)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Good, I.J.: The colleague matrix, a Chebyshev analogue of the companion matrix. Q. J. Math. 12, 61–68 (1961)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Longman, Boston (1994)MATHGoogle Scholar
  15. 15.
    Higham, N., Li, R., Tisseur, F.: Backward error of polynomial eigenproblems solved by linearization. SIAM J. Matrix Anal. Appl. 29, 1218–1241 (2008)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Lawrence, P.W.: Fast reduction of generalized companion matrix pairs for barycentric lagrange interpolants. SIAM J. Matrix Anal. Appl. 34, 1277–1300 (2013)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Lawrence, P.W., Corless, R.M.: Numerical stability of barycentric Hermite root-finding. In: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation, pp. 147–148. ACM (2012)Google Scholar
  18. 18.
    Lemonnier, D., Van Dooren, P.: Optimal scaling of block companion pencils. In: International Symposium on Mathematical Theory of Networks and Systems. Leuven (2004)Google Scholar
  19. 19.
    Lemonnier, D., Van Dooren, P.: Balancing regular matrix pencils. SIAM J. Matrix Anal. Appl. 28, 253–263 (2006)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Moler, C.: Cleve’s corner: Roots-of polynomials, that is. Math. Work. Newsl. 5, 8–9 (1991)Google Scholar
  21. 21.
    Parlett, B., Reinsch, C.: Balancing a matrix for calculation of eigenvalues and eigenvectors. Numer. Math. 13, 293–304 (1969)CrossRefMATHMathSciNetGoogle Scholar
  22. 22.
    Specht, W.: Die lage der nullstellen eines polynoms. III. Math. Nachr. 16, 369–389 (1957)CrossRefMathSciNetGoogle Scholar
  23. 23.
    Toh, K.-C., Trefethen, L.N.: Pseudozeros of polynomials and pseudospectra of companion matrices. Numer. Math. 68, 403–425 (1994)CrossRefMATHMathSciNetGoogle Scholar
  24. 24.
    Trefethen, L.N.: Approximation theory and approximation practice. Society for Industrial and Applied Mathematics (2012)Google Scholar
  25. 25.
    Ward, R.C.: Balancing the generalized eigenvalue problem. SIAM J. Sci. Stat. Comput. 2, 141–152 (1981)CrossRefMATHGoogle Scholar
  26. 26.
    Watkins, D.S.: The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods. Society for Industrial and Applied Mathematics (2007)Google Scholar
  27. 27.
    Wilkinson, J.: The evaluation of the zeros of ill-conditioned polynomials. Part II. Numer. Math. 1, 167–180 (1959)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Applied MathematicsThe University of Western OntarioLondonCanada

Personalised recommendations