Abstract
A fast implicit QR algorithm for eigenvalue computation of low rank corrections of Hermitian matrices is adjusted to work with matrix pencils arising from zerofinding problems for polynomials expressed in Chebyshev-like bases. The modified QZ algorithm computes the generalized eigenvalues of certain \(N\times N\) rank structured matrix pencils using \(O(N^2)\) flops and \(O(N)\) memory storage. Numerical experiments and comparisons confirm the effectiveness and the stability of the proposed method.
Similar content being viewed by others
Notes
MATLAB is a registered trademark of The Mathworks, Inc..
References
Amiraslani, A., Corless, R.M., Gonzalez-Vega, L., Shakoori, A.: Polynomial Algebra by Values. Technical Report 04–01, Ontario Research Centre for Computer Algebra (2004)
Amiraslani, A., Corless, R.M., Lancaster, P.: Linearization of matrix polynomials expressed in polynomial bases. IMA J. Numer. Anal. 29, 141–157 (2009)
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. SIAM, Philadelphia (1999)
Arbenz, P., Golub, G.H.: \(QR\)-like algorithms for symmetric arrow matrices. SIAM J. Matrix Anal. Appl. 13, 655–658 (1992)
Arbenz, P., Golub, G.H.: Matrix shapes invariant under the symmetric \(QR\) algorithm. Numer. Linear Algebra Appl. 2, 87–93 (1995)
Aruliah, D.A., Corless, R.M., Gonzalez-Vega, L., Shakoori, A.: Geometric applications of the Bézout matrix in the Lagrange basis. In: SNC’07, pp. 55–64. ACM, New York (2007)
Van Barel, M., Vandebril, R., Van Dooren, P., Frederix, K.: Implicit double shift \(QR\)-algorithm for companion matrices. Numer. Math. 116, 177–212 (2010)
Battles, Z., Trefethen, L.N.: An extension of MATLAB to continuous functions and operators. SIAM J. Sci. Comput. 25, 1743–1770 (2004)
Berrut, J.-P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46, 501–517 (2004)
Bini, D.A., Boito, P., Eidelman, Y., Gemignani, L., Gohberg, I.: A fast implicit QR Eigenvalue algorithm for companion matrices. Linear Algebra Appl. 432, 2006–2031 (2010)
Boito, P., Eidelman, Y., Gemignani, L., Gohberg, I.: Implicit QR with compression. Indag. Math. 23, 733–761 (2012)
Boyd, J.P.: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM J. Numer. Anal. 40, 1666–1682 (2002)
Boyd, J.P.: Computing real roots of a polynomial in Chebyshev series form through subdivision. Appl. Numer. Math. 56, 1077–1091 (2006)
Chandrasekaran, S., Gu, M., Xia, J., Zhu, J.: A fast QR algorithm for companion matrices. In: Recent Advances in Matrix and Operator Theory, Oper. Theory Adv. Appl., vol. 179, pp. 111–143. Birkhäuser, Basel (2008)
Corless, R.M.: On a generalized companion matrix pencil for matrix polynomials expressed in the Lagrange basis. In: Symbolic-Numeric Computation, Trends Math, pp. 1–15. Birkhäuser, Basel (2007)
Day, D., Romero, L.: Roots of polynomials expressed in terms of orthogonal polynomials. SIAM J. Numer. Anal. 43, 1969–1987 (2005)
de Boor, C.: An empty exercise. ACM SIGNUM Newslett. 25(4), 2–6 (1990)
Eidelman, Y., Gohberg, I.: On a new class of structured matrices. Integral Equ. Oper. Theory 34, 293–324 (1999)
Eidelman, Y., Gohberg, I., Haimovici, I.: Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms. Operator Theory: Advances and Applications, Birkhäuser (2013)
Eidelman, Y., Gohberg, I., Haimovici, I.: Separable type representations of matrices and fast algorithms, vol. 2, Eigenvalue method. Operator Theory: Advances and Applications. Birkhäuser (2013)
Fiedler, M., Markham, T.L.: Completing a matrix when certain entries of its inverse are specified. Linear Algebra Appl. 74, 225–237 (1986)
Frayssé, V., Toumazou, V.: A note on the normwise perturbation theory for the regular generalized eigenproblem. Numer. Linear Algebra Appl. 5, 1–10 (1998)
Gemignani, L.: Quasiseparable structures of companion pencils under the QZ-algorithm. Calcolo 42, 215–226 (2005)
Gemignani, L., Noferini, V.: The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis. Linear Algebra Appl. 438, 1645–1666 (2013)
Golub, G.H., Uhlig, F.: The \(QR\) algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments. IMA J. Numer. Anal. 29, 467–485 (2009)
Golub, G.H., Van Loan, C.F.: Matrix computations, 4th edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2013)
Good, I.J.: The colleague matrix, a Chebyshev analogue of the companion matrix. Q. J. Math. Oxf. Ser. 12, 61–68 (1961)
Salzer, H.E.: Lagrangian interpolation at the Chebyshev points \(X_{n,v} \equiv (v \pi /n)\), \(v =0(1)n\); some unnoted advantages. Comput. J. 15, 156–159 (1972)
Tisseur, F.: Backward error and condition of polynomial eigenvalue problems. Linear Algebra Appl. 309, pp. 339–361 (2000)
Vanberghen, Y., Vandebril, R., Van Barel, M.: A \(QZ\)-method based on semiseparable matrices. J. Comput. Appl. Math. 218, 482–491 (2008)
Watkins, D.S.: Fundamentals of Matrix Computations, Pure and Applied Mathematics (New York), 3rd edn. Wiley-Interscience (Wiley), New York (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ahmed Salam.
This work was partially supported by MIUR, grant number 20083KLJEZ.
Rights and permissions
About this article
Cite this article
Boito, P., Eidelman, Y. & Gemignani, L. Implicit QR for rank-structured matrix pencils. Bit Numer Math 54, 85–111 (2014). https://doi.org/10.1007/s10543-014-0478-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-014-0478-0
Keywords
- Rank-structured matrix
- Quasiseparable matrix
- QZ algorithm
- Chebyshev approximation
- Eigenvalue computation
- Complexity