Interval matrices: realization of ranks by rational matrices
From MaRDI portal
Publication:2226435
DOI10.1016/j.laa.2020.09.017zbMath1457.15028arXiv1911.05762OpenAlexW3087230533MaRDI QIDQ2226435
Publication date: 12 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.05762
General methods in interval analysis (65G40) Basic linear algebra (15A99) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sign patterns of rational matrices with large rank
- Systems of linear interval equations
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers
- On rank range of interval matrices
- Enclosing solutions of overdetermined systems of linear interval equations
- Maximal rank Hermitian completions of partially specified Hermitian matrices.
- Low-rank matrix approximation in the infinity norm
- The minimum rank problem: A counterexample
- Orthogonal representations over finite fields and the chromatic number of graphs
- Rational realizations of the minimum rank of a sign pattern matrix
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- On full-rank interval matrices
- Minimum ranks of sign patterns via sign vectors and duality
- Introduction to Interval Analysis
- A generalization of Rohn's theorem on full-rank interval matrices
- Generalization of real interval matrices to other fields
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
This page was built for publication: Interval matrices: realization of ranks by rational matrices