The matrix equation \(XA=A^ TX\) and an associated algorithm for solving the inertia and stability problems
type: Item
instance of: scholarly article
title: The matrix equation \(XA=A^ TX\) and an associated algorithm for solving the inertia and stability problems
zbMATH Open document ID: 0634.93025
DOI: 10.1016/0024-3795(87)90143-1
author: Biswa Nath Datta
author: Karabi Datta
published in: Linear Algebra and its Applications
publication date: 1987-01-01T00:00:00Z
review text: This paper considers the matrix equations (1) \(XA=A^ TX\) with A as an unreduced lower Hessenberg matrix of order n, and establishes an interesting relationship between a given solution X of (1) and the associated matrix polynomial p(A). It is used to develop an algorithm for computing the inertia of A. The inertia of a matrix is defined to be an integer triple \(In(A)=(\pi (A),\nu (A),\delta (A))\), where \(\pi\) (A), \(\nu\) (A) and \(\delta\) (A) are respectively the numbers of eigenvalues of A with positive, negative, and zero real parts. This paper proposes an algorithm for computing In(A) and compares its efficiency with existing ones.
Mathematics Subject Classification ID: 93B40
Mathematics Subject Classification ID: 15A24
Mathematics Subject Classification ID: 93C99
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 4033596
zbMATH Keywords: matrix equations
zbMATH Keywords: Hessenberg matrix
zbMATH Keywords: inertia
zbMATH Keywords: algorithm
describes a project that uses: Algorithm 432
MaRDI profile type: MaRDI publication profile
full work available at URL: 0024-3795(87)90143-1
OpenAlex ID: W2030438400
cites work: Controllability, observability and the solution of AX-XB=C
cites work: On the effective computation of the inertia of a non-hermitian matrix
cites work: An algorithm for computing powers of a Hessenberg matrix and its applications
cites work: The matrix equation \(XA-BX=R\) and its applications
cites work: Computing powers of arbitrary Hessenberg matrices
cites work: Q3254327
cites work: A general theory for matrix root-clustering in subregions of the complex plane
cites work: Remarks on the root-clustering of a polynomial in a certain region in the complex plane
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
cites work: On the similarity transformation between a matrix and its transpose
cites work: Q5674306
cites work: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
cites work: A Note on the Bezoutian Matrix
Recommended article: A new algorithm for computing the inertia of eigenproblems \((Ax=\lambda x)\) and \((Ax=\lambda Bx)\)
Recommended article: Q2931231
Recommended article: Q4415256
Recommended article: The complexity of the inertia
Recommended article: Possible inertias for the hermitian part ofA+BX
description: scientific article; zbMATH DE number 4033596