Computing the inertia of Bézout and Hankel matrices

DOI10.1007/BF02575814MaRDI QIDQ1201962zbMATH OpenFDO

Authors L. Gemignani

Publication date 19 January 1993

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02575814

zbMATH Keywords

block factorizationdiagonal matrixEuclidean schemeHankel and Bézout matricesinertianumbers of eigenvaluessequential algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

This paper is concerned with a sequential algorithm for computing the diagonal matrix \(D\) in the block \(LDL^ T\) factorization which evaluates the inertia of real Hankel and Bézout matrices \(A\) (i.e., the numbers of eigenvalues of \(A\) with positive, zero, and negative real parts). The algorithm is \(O(n\log^ 3n)\), better than any other known sequential algorithm for this problem. This improvement stems from relations between the polynomial remainder sequences generated by the Euclidean scheme when applied to two polynomials, and by Bézout and Hankel matrix computations developed by \textit{D. Bini}, the author, and \textit{V. Pan} [Improved parallel computations with matrices and polynomials; Proc. 18th EATCS International Colloquium on Automata, Languages and Programming, Lect. Notes Comput. Sci. 510 (Springer 1991)].

Recommendations

• A fast method to compute the inertia of Bézout matrix and its application
• A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials
• Computationally efficient applications of the Euclidean algorithm to zero location
• Fast inversion of Hankel and Toeplitz matrices
• Computing the polynomial remainder sequence via Bézout matrices

Cites work

• Algebraic methods for Toeplitz-like matrices and operators
• Fast parallel matrix and GCD computations
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile
• Hankel and Loewner matrices
• scientific article; zbMATH DE number 3775748 (Why is no real title available?)
• scientific article; zbMATH DE number 176760 (Why is no real title available?)
• On the partial realization problem
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations

Cited in

(9)

• A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials
• Cauchy index computation
• Symmetric subresultants and applications
• Computationally efficient applications of the Euclidean algorithm to zero location
• A fast method to compute the inertia of Bézout matrix and its application
• scientific article; zbMATH DE number 3967800 (Why is no real title available?)
• The inertia of the components in the Cartesian decomposition of a square matrix
• Sylvester-Habicht sequences and fast Cauchy index computation
• A fast iterative method for determining the stability of a polynomial

This page was built for publication: Computing the inertia of Bézout and Hankel matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201962)