On the applicability of the interval Gaussian algorithm
Let a system of linear interval equations, \(Ax =b\), be given where \(A\) is of the special form \(A= I +[-R,R]\) and regular, \(I\) is the identity matrix and \(R\) is a matrix with nonnegative real entries. The application of the interval Newton algorithm is investigated. The authors call the algorithm applicable to the system if no division through zero occurs during the computation so that a finite solution \(x_G\) is obtained. Now, necessary and sufficient conditions for the system are derived that the algorithm is applicable. Then it is shown that each component of \(x_G\), which is an interval vector has an endpoint which is optimum.
- Interval analysis: Theory and applications
- Interval mathematics, algebraic equations and optimization
- An approach to overcome division by zero in the interval Gauss algorithm
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- Highly accurate verified error bounds for Krylov type linear system solvers
- How strong is strong regularity?
- Interval-affine Gaussian algorthm for constrained systems
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- A contribution to the feasibility of the interval Gaussian algorithm
- Direct methods for linear systems with inexact input data
- On regular and singular interval systems
- Interval linear systems: the state of the art
This page was built for publication: On the applicability of the interval Gaussian algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276141)
