Computing the inertia of Bézout and Hankel matrices

DOI10.1007/BF02575814zbMath0766.65035MaRDI QIDQ1201962

Luca Gemignani

Publication date: 19 January 1993

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

sequential algorithminertiablock factorizationdiagonal matrixnumbers of eigenvaluesEuclidean schemeHankel and Bézout matrices

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ A fast iterative method for determining the stability of a polynomial ⋮ Computationally efficient applications of the Euclidean algorithm to zero location

Cites Work

• Unnamed Item
• Unnamed Item
• Hankel and Loewner matrices
• Algebraic methods for Toeplitz-like matrices and operators
• On the partial realization problem
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• 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
• Fast parallel matrix and GCD computations

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