An overview of polynomially computable characteristics of special interval matrices

DOI10.1007/978-3-030-31041-7_16MaRDI QIDQ2215911zbMATH OpenOpenAlexFDO

Authors Milan Hladík

Publication date 15 December 2020

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

zbMATH Keywords

computational complexityH-matrixinterval computationinverse nonnegative matrixm-matrixP-matrixtridiagonal matrix

Mathematics Subject Classification ID

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215911)