On nonsingularity of a polytope of matrices
From MaRDI portal
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)].
Recommendations
- On nonsingular \(M\)-matrices
- Nonsingularity and P-matrices.
- On the extremal points of a class of polytopes of matrices
- Total nonpositivity of nonsingular matrices
- Convex sets of nonsingular and P:–Matrices
- scientific article; zbMATH DE number 3963076
- On nonsingularity of linear combinations of tripotent matrices
- On the nonsingularity of matrices with certain sign patterns
- A nonsingularity criterion for matrices
- On nonsingularity of circulant matrices
Cites work
- A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
- A necessary and sufficient criterion for the stability of a convex set of matrices
- An algorithm for checking stability of symmetric interval matrices
- Guardian maps and the generalized stability of parametrized families of matrices and polynomials
- scientific article; zbMATH DE number 3965308 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- scientific article; zbMATH DE number 5050658 (Why is no real title available?)
- scientific article; zbMATH DE number 3385504 (Why is no real title available?)
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- Maximal unidirectional perturbation bounds for stability of polynomials and matrices
- On the spectrum of convex sets of matrices
- On the stability of a convex set of matrices
- Positive Definiteness and Stability of Interval Matrices
- Probabilistic solutions to some NP-hard matrix problems
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
- Several NP-hard problems arising in robust stability analysis
- Systems of linear interval equations
Cited in
(12)- Testing the definiteness of matrices on polyhedral cones
- Almost definiteness of matrices on polyhedral cones
- Nonsingularity of some classes of matrices, and minimal solutions of Silverman's game on discrete sets
- Nondegeneracy of polyhedra and linear programs
- Birkhoff's polytope and unistochastic matrices, N=3 and N=4
- The polytope of Tesler matrices (extended abstract)
- On nonsingularity of linear combinations of tripotent matrices
- scientific article; zbMATH DE number 3899662 (Why is no real title available?)
- On stability of parametrized families of polynomials and matrices
- On different types of stability of linear polytopic systems
- On the combinatorial structure of \(0/1\)-matrices representing nonobtuse simplices
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
This page was built for publication: On nonsingularity of a polytope of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935386)
