Abstract
For a Laurent polynomial \(a(\lambda )\), which is Hermitian and positive definite on the unit circle, the Bauer method provides the spectral factorization \(a(\lambda ) = p(\lambda )p{\kern 1pt} {\text{*}}({{\lambda }^{{ - 1}}})\), where \(p(\lambda )\) is a polynomial having all its roots outside the unit circle. Namely, as the size of the banded Hermitian positive definite Toeplitz matrix associated with the Laurent polynomial increases, the coefficients at the bottom of its Cholesky lower triangular factor tend to the coefficients of \(p(\lambda )\). We study extensions of the Bauer method to the non-Hermitian matrix case. In the Hermitian case, we give new convergence bounds with computable coefficients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
F. L. Bauer, “Ein direktes Iterationsverfahren zur Hurwitz–Zerlegung eines Polynoms,” Arch. Elektr. Ubertragung. 9, 285–290 (1955).
F. L. Bauer, “Beiträge zur Entwicklung numerischer Verfahren für programmgesteuerte Rechenanlagen, II. Direkte Faktorisierung eines Polynoms,” Sitzung Bericht Bayerischen Akademische Wissenschaften (1956), pp. 163–203.
E. A. Biberdorf, “A criterion for the dichotomy of roots of a polynomial on the unit circle,” Sib. Zh. Ind. Math. 3, 16–32 (2000).
D. A. Bini, G. Fiorentino, L. Gemignani, and B. Meini, “Effective fast algorithms for polynomial spectral factorization,” Numer. Algorithms 34, 217–227 (2003).
D. A. Bini and A. Böttcher, “Polynomial factorization through Toeplitz matrix computation,” Linear Algebra Appl. 366, 25–37 (2003).
D. A. Bini and L. Gemignani, “Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complement of Toeplitz matrices,” Numer. Linear Appl. 12, 181–189 (2005).
A. Böttcher and M. Halwass, “Wiener–Hopf and spectral factorization of real polynomials by Newton's method,” Linear Algebra Appl. 438, 4760–4805 (2013).
A. Böttcher and M. Halwass, “A Newton method for canonical Wiener–Hopf and spectral factorization of matrix polynomials,” Electron. J. Linear Algebra. 26, 873–897 (2013).
H. R. Gail, S. L. Hantler, and B. A. Taylor, “Spectral analysis of M/G/1 and G/M/1 type Markov chains,” Adv. Appl. Probab. 28, 114–165 (1996).
S. K. Godunov, Modern Aspects of Linear Algebra (Am. Math. Soc., 1998).
I. Gohberg, P. Lancaster, and L. Rodman, Matrix Polynomials (Academic, New York, 1982).
I. Gohberg, P. Lancaster, and L. Rodman, Indefinite Linear Algebra and Applications (Birkhäuser, Basel, 2005).
G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1996).
T. N. T. Goodman, C. A. Micchelli, G. Rodriguez, and S. Seatzu, “On the Cholesky factorization of the Gram matrix of locally supported functions,” BIT 35, 233–257 (1995).
T. N. T. Goodman, C. A. Micchelli, G. Rodriguez, and S. Seatzu, “Spectral factorization of Laurent polynomials,” Adv. Comput. Math. 7, 429–454 (1997).
R. A. Horn and C. R. Johnson, Topics in Matrix Analysis (Cambridge Univ. Press, Cambridge, 1990).
V. B. Khazanov and V. N. Kublanovskaya, “Spectral problems for matrix pencils: Methods and algorithms I, II,” Sov. J. Numer. Anal. Math. Model. 33, 337–371, 467–485 (1989).
V. N. Kublanovskaya, “AB-algorithm and its modifications for the spectral problem of linear pencils of matrices,” Numer. Math. 43, 329–342 (1984).
V. Kučera, Analysis and Design of Discrete Linear Control Systems (Academia, Prague, 1991).
G. Malajovich and J. P. Zubellu, “A fast and stable algorithm for splitting polynomials,” Comput. Math. Appl. 31, 1–23 (1997).
A. Malyshev, “Factorization of matrix polynomials,” Sib. Math. J. 23, 399–408 (1983).
A. Malyshev, “Guaranteed accuracy in spectral problems of linear algebra II” Sib. Adv. Math. 2 (2), 153–204 (1992).
A. Malyshev, “On the acceleration of an algorithm for polynomial factorization.” Dokl. Math. 88 (2) 586–589 (2013).
G. Rama Murthy, M. Kim, and E. J. Coyle, “Equilibrium analysis of skip free Markov chains: Nonlinear matrix equations,” Commun. Stat. Stochastic Models. 7, 547–571 (1991).
M. Rosenblatt, “A multi-dimensional prediction problem,” Ark. Math. 3, 407–424 (1958).
A. H. Sayed and T. Kailath, “A survey of spectral factorization methods,” Numer. Linear Algebra Appl. 8, 467–496 (2001).
I. D. Sofronov, “A double sweep method for the solution of difference boundary value problems,” USSR Comput. Math. Math. Phys. 4 (2), 62–76 (1964).
G. Strang and T. Nguyen, Wavelet and Filter Banks (Wellesley-Cambridge Press, Wellesley, MA, 1996).
E. C. Titchmarsch, The Theory of Functions, 2nd ed. (Oxford Univ. Press, London, 1939).
D. C. Youla and N. N. Kazanjian, “Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle,” IEEE Trans. Circuits Syst. Autom. 8, 57–69 (1978).
C. Van der Mee, G. Rodriguez, and S. Seatzu, “LDU factorization results for bi-infinite and semi-infinite scalar and block Toeplitz matrices,” Calcolo 33, 307–335 (1999).
Z. Vostry, “New algorithm of the polynomial spectral factorization with quadratic convergence,” Part I, Kybernetika 11, 415–422 (1975);
Part II, Kybernetika 12, 248–259 (1976).
G. Wilson, “Factorization of the covariance generating function of a pure moving average process,” SIAM J. Numer. Anal. 6, 1–7 (1969).
ACKNOWLEDGMENTS
The authors thank the anonymous reviewer for the helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding authors
Additional information
1The article is published in the original.
Rights and permissions
About this article
Cite this article
Malyshev, A., Sadkane, M. The Bauer-Type Factorization of Matrix Polynomials Revisited and Extended. Comput. Math. and Math. Phys. 58, 1025–1034 (2018). https://doi.org/10.1134/S0965542518070126
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542518070126