On nonsingularity of a polytope of matrices
type: Item
instance of: scholarly article
title: On nonsingularity of a polytope of matrices
zbMATH Open document ID: 1152.15026
author: Vakif Dzhafarov
author: Taner Büyükköroğlu
published in: Linear Algebra and its Applications
publication date: 2008-08-06T00:00:00Z
review text: Given \(k\) real \(n\times n\) matrices \(A_1,\dots,A_k\), the authors study the nonsingularity and stability of the polytope \(\text{conv}\,\{A_1,\dots,A_k\}\) using the Bernstein algorithm of \textit{J. Garloff} [Interval Comput. 1993, No.~2, 154--168 (1993; Zbl 0829.65017)] and of \textit{M. Zettler} and \textit{J. Garloff} [IEEE Trans. Autom. Control 43, No.~3, 425--431 (1998; Zbl 0906.93046)].
reviewed by: Martín Argerami
Mathematics Subject Classification ID: 15A60
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 41A17
Mathematics Subject Classification ID: 93D09
zbMATH DE Number: 5307057
zbMATH Keywords: polytope of matrices
zbMATH Keywords: nonsingularity
zbMATH Keywords: stability
zbMATH Keywords: multivariate polynomial
zbMATH Keywords: Bernstein expansion
MaRDI profile type: Publication
full work available at URL: j.laa.2007.06.026
OpenAlex ID: W2081287323
cites work: A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
cites work: Maximal unidirectional perturbation bounds for stability of polynomials and matrices
cites work: Systems of linear interval equations
cites work: Guardian maps and the generalized stability of parametrized families of matrices and polynomials
cites work: Q5485394
cites work: On the spectrum of convex sets of matrices
cites work: A necessary and sufficient criterion for the stability of a convex set of matrices
cites work: An algorithm for checking stability of symmetric interval matrices
cites work: Positive Definiteness and Stability of Interval Matrices
cites work: Several NP-hard problems arising in robust stability analysis
cites work: Probabilistic solutions to some NP-hard matrix problems
cites work: Q4851610
cites work: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
cites work: Q3732843
cites work: Q4040931
cites work: On the stability of a convex set of matrices
cites work: Q5655243
cites work: Investigation of a subdivision based algorithm for solving systems of polynomial equations.
DOI: 10.1016/J.LAA.2007.06.026
Recommended article: On nonsingular \(M\)-matrices
Recommended article: Nonsingularity and $P$-matrices.
Recommended article: On the extremal points of a class of polytopes of matrices
Recommended article: Total nonpositivity of nonsingular matrices
Recommended article: Convex sets of nonsingular and P:–Matrices
Recommended article: Q3730928
Recommended article: On nonsingularity of linear combinations of tripotent matrices
Recommended article: On the nonsingularity of matrices with certain sign patterns
Recommended article: A nonsingularity criterion for matrices
Recommended article: On nonsingularity of circulant matrices
description: scientific article; zbMATH DE number 5307057