Determinants of interval matrices
From MaRDI portal
Abstract: In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both relative and absolute approximation is proved. Next, methods computing verified enclosures of interval determinants and their possible combination with preconditioning are discussed. A new method based on Cramer's rule was designed. It returns similar results to the state-of-the-art method, however, it is less consuming regarding computational time. As a byproduct, the Gerschgorin circles were generalized for interval matrices. New results about classes of interval matrices with polynomially computable tasks related to determinant are proved (symmetric positive definite matrices, class of matrices with identity midpoint matrix, tridiagonal H-matrices). The mentioned methods were exhaustively compared for random general and symmetric matrices.
Recommendations
Cites work
- A filtering method for the interval eigenvalue problem
- A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
- A simple method for error bounds of eigenvalues of symmetric matrices
- A Unified Approach to Enclosure Methods for Eigenpairs
- Bounds on eigenvalues of real and complex interval matrices
- Bounds on real eigenvalues and singular values of interval matrices
- Checking robust nonsingularity of tridiagonal matrices in linear time
- Computational complexity and feasibility of data processing and interval computations
- Computing eigenvalue bounds of structures with uncertain‐but‐non‐random parameters by a method based on perturbation theory
- Criteria for sign regularity of sets of matrices
- Eigenvalue range determination for interval and parametric matrices
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 1305465 (Why is no real title available?)
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- scientific article; zbMATH DE number 1952042 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 804623 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Interval arithmetic determinant evaluation and its use in testing for a Chebyshev system
- Interval Arithmetic in Matrix Computations, Part II
- Interval Methods for Systems of Equations
- Introduction to Interval Analysis
- Inverse Interval Matrix
- New operator and method for solving real preconditioned interval linear equations
- New techniques for the analysis of linear interval equations
- On the regularity of the inverse Jacobian of parallel robots
- Optimal preconditioning for the interval parametric Gauss-Seidel method
- Outer interval solution of the eigenvalue problem under general form parametric dependencies
- Positive Definiteness and Stability of Interval Matrices
- Preconditioners for the Interval Gauss–Seidel Method
- Verification methods: rigorous results using floating-point arithmetic
Cited in
(3)
This page was built for publication: Determinants of interval matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615521)
