Complexity of computing interval matrix powers for special classes of matrices.

DOI10.21136/AM.2020.0379-19MaRDI QIDQ2216226

Milan Hladík, David Hartman

Publication date: 15 December 2020

Published in: Applications of Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval computationsNP-hardnessinterval matrixmatrix power

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Special matrices (15Bxx)

Related Items (1)

Computing the spectral decomposition of interval matrices and a study on interval matrix powers

Cites Work

• Unnamed Item
• Unnamed Item
• Interval analysis and automatic result verification
• Topologically sweeping an arrangement
• Sharpness in interval computations
• Computational complexity and feasibility of data processing and interval computations
• The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
• Parametric interval algebraic systems
• Checking robust nonsingularity is NP-hard
• An overview of polynomially computable characteristics of special interval matrices
• Iterative learning control. Robustness and monotonic convergence for interval systems.
• Tight Bounds on the Radius of Nonsingularity
• Introduction to Interval Analysis
• Robust control of interval plants: A time domain method
• Computing the norm ∥A∥∞,1 is NP-hard^∗
• Regularity radius: Properties, approximation and a not a priori exponential algorithm
• Direct and iterative methods for interval parametric algebraic systems producing parametric solutions
• Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics
• Partition of Space

This page was built for publication: Complexity of computing interval matrix powers for special classes of matrices.