# On matrices with non-positive off-diagonal elements and positive principal minors

@article{Fiedler1962OnMW, title={On matrices with non-positive off-diagonal elements and positive principal minors}, author={Miroslav Fiedler and Vlastimil Pt{\'a}k}, journal={Czechoslovak Mathematical Journal}, year={1962}, volume={12}, pages={382-400} }

## 789 Citations

A Mathematical Study of a Generalized SEIR Model of COVID-19

- Mathematics
- 2020

In this work (Part I), we reinvestigate the study of the stability of the Covid-19 mathematical model constructed by Shah et al. (2020) [1]. In their paper, the transmission of the virus under…

On Linear Complementarity Problem with Hidden Z-Matrix

- Mathematics
- 2018

In this article we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.…

Metzlerian and Generalized Metzlerian Matrices: Some Properties and Economic Applications

- Economics, Mathematics
- 2015

In the first part of the paper we consider the main properties, with respectto stability and existence of solutions of multi-sectoral economic models,of Metzlerian and Morishima matrices. In the…

P-Operators on Hilbert Spaces

- Mathematics
- 2022

A real square matrix A is called a P-matrix if all its principal minors are positive. Using the sign non-reversal property of matrices, the notion of P-matrix has been recently extended by Kannan and…

Hierarchical Selective Recruitment in Linear-Threshold Brain Networks—Part I: Single-Layer Dynamics and Selective Inhibition

- Computer ScienceIEEE Transactions on Automatic Control
- 2021

The internal dynamics of each layer of the hierarchy described as a network with linear-threshold dynamics are analyzed and derive conditions on its structure to guarantee existence and uniqueness of equilibria, asymptotic stability, and boundedness of trajectories.

Network Comparative Statics

- Computer Science
- 2020

This paper develops a framework for analyzing the effect of arbitrary changes to network structure in linear-quadratic games on networks and finds total activity is a convex function of the edge weights of the network, which allows for convex optimization techniques to be applied to minimize total activity.

O C ] 3 0 M ay 2 01 9 More On Hidden Z-Matrices and Linear Complementarity Problem

- Mathematics
- 2019

In this article we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.…

An algorithmic characterization of P-matricity II : adjustments , refinements , and validation

- Mathematics
- 2019

The paper “An algorithmic characterization of P-matricity” (SIAM Journal on Matrix Analysis and Applications, 34:3 (2013) 904–916, by the same authors as here) implicitly assumes that the iterates…

An algorithmic characterization of P-matricity II : adjustments , refinements , and validation

- Mathematics
- 2018

The paper “An algorithmic characterization of P-matricity” (SIAM Journal on Matrix Analysis and Applications, 34:3 (2013) 904–916, by the same authors as here) implicitly assumes that the iterates…