Trace minimization and definiteness of symmetric pencils
type: Item
instance of: scholarly article
title: Trace minimization and definiteness of symmetric pencils
zbMATH Open document ID: 0821.15008
DOI: 10.1016/0024-3795(93)00126-K
author: Krešimir Veselić
author: Jelisaveta Kovac Striko
published in: Linear Algebra and its Applications
publication date: 1995-09-28T00:00:00Z
review text: The authors are interested in the following extremal problem for a general pair of symmetric matrices \(A,B\): \(TrX^ T AX = \min\), \(X^ T BX = J_ 1\) where \(B\) is nonsingular, \(J = \text{diag} (I_{p_ 1}, - I_{q_ 1})\), and \(p_ 1 \leq p\), \(q_ 1 \leq q\), with \((p,q)\) as the inertia of \(B\). They first prove an interlacing theorem of Cauchy type for a pair \(A,B\) with \[ {B = J = \text{diag} (\varepsilon_ 1, \dots, \varepsilon_ n)},\quad\varepsilon_ i \in \{- 1,1\}. \] The theorem ascertains the interlacing relation of the eigenvalues \(\theta^ +_ i\), \(\theta^ - _ j\) of the pairs \(A,J\) and \(H,J\) respectively, where \[ A = \left( \begin{smallmatrix} H & K^ T \\ K & U \end{smallmatrix} \right) \quad J = \left( \begin{smallmatrix} J_ 1 & O \\ O & J_ 2 \end{smallmatrix} \right). \] They next show the existence of the minimum listed above and that this existence implies the positive-definiteness of the pair \(A,B\) and that any minimizing \(X_ 1\) spans a spectral subspace for the pair \(A,J\).
reviewed by: Yang Yingchen
Mathematics Subject Classification ID: 15A22
Mathematics Subject Classification ID: 15A42
zbMATH DE Number: 753887
zbMATH Keywords: matrix pencil
zbMATH Keywords: interlacing of eigenvalues
zbMATH Keywords: minimization of the trace
zbMATH Keywords: extremal problem
zbMATH Keywords: pair of symmetric matrices
zbMATH Keywords: inertia
MaRDI profile type: Publication
cites work: Q3230107
cites work: Finding a positive definite linear combination of two Hermitian matrices
cites work: Matrices and indefinite scalar products
cites work: Some remarks on the spectra of Hermitian matrices
cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations
cites work: A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
cites work: Perturbation bounds for the definite generalized eigenvalue problem
Recommended article: Trace minimization principles for positive semi-definite pencils
Recommended article: SYMMETRY AND SYMMETRY BREAKING FOR MINIMIZERS IN THE TRACE INEQUALITY
Recommended article: On the Least Squares Approximation of Symmetric-Definite Pencils Subject to Generalized Spectral Constraints
Recommended article: The trace minimization method for the symmetric generalized eigenvalue problem
Recommended article: ON THE MINIMIZATION OF SYMMETRIC FUNCTIONALS
Recommended article: Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem
Recommended article: Q4306951
Recommended article: Minimization of a class of matrix trace functions by means of refined majorization
Recommended article: On the symmetry of minimizers in constrained quasi-linear problems
Recommended article: On the symmetry of minimizers
description: scientific article; zbMATH DE number 753887