An overview of polynomially computable characteristics of special interval matrices

DOI10.1007/978-3-030-31041-7_16OpenAlexW2770218907MaRDI QIDQ2215911

Milan Hladík

Publication date: 15 December 2020

Full work available at URL: https://arxiv.org/abs/1711.08732

zbMATH Keywords

computational complexitytridiagonal matrixP-matrixH-matrixinterval computationinverse nonnegative matrixm-matrix

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (5)

Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes ⋮ Error bounds and a condition number for the absolute value equations ⋮ Interval matrices with Monge property. ⋮ Complexity of computing interval matrix powers for special classes of matrices. ⋮ Stability of the linear complementarity problem properties under interval uncertainty

This page was built for publication: An overview of polynomially computable characteristics of special interval matrices