Extension of the Hansen-Bliek method to right-quantified linear systems
Given an interval matrix \({\mathbf A}\subset\mathbb{R}^{n\times n}\), an interval vector \({\mathbf b}=({\mathbf b}_i)\subset\mathbb{R}^n\), and an index \(s\leq n\) the right-quantified solution set \(\Sigma\) of the linear interval system \({\mathbf A}x= {\mathbf b}\) is defined by \[ \begin{multlined} \Sigma=\{x\in\mathbb{R}^n \mid(\forall b_1\in{\mathbf b}_1) \dots(\forall b_s\in{\mathbf b}_s)(\exists A\in{\mathbf A})(\exists b_{s+1}\in{\mathbf b}_{s+1})\dots (\exists b_n\in{\mathbf b}_n)\\ Ax=(b_1,\dots,b_n)^T\}. \end{multlined} \] If the midpoint of \({\mathbf A}\) is the identity matrix and if the spectral radius of the radius of \({\mathbf A}\) is less than one, the authors construct vectors \(\underline x\), \(\overline x\in\mathbb{R}^n\) which either are optimal bounds for \(\Sigma\) or which show that \(\Sigma\) is empty. The proof is lengthy, the underlying algorithm can be carried out in polynomial-time. The method extends a result due to \textit{E. R. Hansen} [SIAM J. Numer. Anal. 29, No.~5, 1493--1503 (1992; Zbl 0756.65035)] and \textit{C. Bliek} [Computer methods for design automation, PhD Thesis, Massachusetts Institute of Technology (1992)] which assumes the index \(s\) above to be zero.
- Bounding the Solution of Interval Linear Equations
- scientific article; zbMATH DE number 804623
- scientific article; zbMATH DE number 1639662
- On the determination of the interval hull of linear interval equations
- An algorithm for computing the hull of the solution set of interval linear equations
- A Comparison of some Methods for Solving Linear Interval Equations
- scientific article; zbMATH DE number 3884313
- Interval linear systems: the state of the art
- An Algorithm for Checking Regularity of Interval Matrices
- scientific article; zbMATH DE number 4110859
- A Comparison of some Methods for Solving Linear Interval Equations
- A new technique in systems analysis under interval uncertainty and ambiguity
- A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets.
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- Bounding the Solution of Interval Linear Equations
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1206080 (Why is no real title available?)
- scientific article; zbMATH DE number 804623 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Interval Gauss-Seidel method for generalized solution sets to interval linear systems
- Interval Methods for Systems of Equations
- On the Solution Set of a Linear System with Inaccurate Coefficients
- Outer estimation of generalized solution sets to interval linear systems
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow
- The solution of linear interval equations by a linear programming method
This page was built for publication: Extension of the Hansen-Bliek method to right-quantified linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641465)
