Theorems of Perron-Frobenius type for matrices without sign restrictions
From MaRDI portal
Publication:1372955
DOI10.1016/S0024-3795(96)00522-8zbMath0901.15002MaRDI QIDQ1372955
Publication date: 26 November 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
Direct solution of piecewise linear systems, A short note on the ratio between sign-real and sign-complex spectral radius of a real square matrix, A Perron-Frobenius theorem for a class of positive quasi-polynomial matrices, Characterizations of linear Volterra integral equations with nonnegative kernels, Convergence results for some piecewise linear solvers, Generalized Perron Roots and Solvability of the Absolute Value Equation, On sign-real spectral radii and sign-real expansive matrices, A characterization of the distance to infeasibility under block-structured perturbations, Complete monotonicity for inverse powers of some combinatorially defined polynomials, On stability of a class of positive linear functional difference equations, A Perron-Frobenius theorem for positive quasipolynomial matrices associated with homogeneous difference equations, Positivity and stability of linear functional differential equations with infinite delay, On the block-structured distance to non-surjectivity of sublinear mappings, Solving piecewise linear systems in ABS-normal form, Unnamed Item, Perron-Frobenius theory of seminorms: a topological approach, Stability and robust stability of positive linear Volterra difference equations, A Perron-Frobenius theorem for positive polynomial operators in Banach lattices, Unnamed Item, The sign-real spectral radius and cycle products, On \(P\)-matrices, Perron-Frobenius theory for complex matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Piecewise affine bijections of \(\mathbb R^n\), and the equation \(Sx^ +- Tx^ -=y\)
- Systems of linear interval equations
- Checking robust nonsingularity is NP-hard
- Cyclic and diagonal products on a matrix
- Some generalizations of positive definiteness and monotonicity
- Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Matrix Analysis
- The Componentwise Distance to the Nearest Singular Matrix
- Diagonal similarity and equivalence for matrices over groups with 0
- The Hadamard-Fischer inequality for a class of matrices defined by eigenvalue monotonicity
- Computational complexity of μ calculation
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Lectures on Finite Precision Computations
- A Generalization of a Theorem of Bôcher
- A Partition Theorem for Euclidean n-Space