A contribution to the feasibility of the interval Gaussian algorithm
From MaRDI portal
The author studies feasibility of the interval Gaussian algorithm for solving interval linear systems \([A]x=[b]\) in the case of generalized diagonally dominant matrices; an interval matrix \([A]\) is called generalized diagonally dominant if it satisfies \(\langle[A]\rangle x\geq 0\) for some \(x>0\), where \(\langle[A]\rangle\) is the comparison matrix. It is proved that for an irreducible generalized diagonally dominant interval matrix, the interval Gaussian algorithm is feasible if and only if the signs of the entries of the midpoint matrix follow certain pattern.
Recommendations
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- On the applicability 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
- scientific article; zbMATH DE number 5296963
- On overestimation produced by the interval Gaussian algorithm
- Stable computation of Gaussian interpolants -- a heuristic approach
- Interval-affine Gaussian algorthm for constrained systems
- scientific article; zbMATH DE number 1639655
Cites work
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- Abbruch beim Intervall-Gauß-Algorithmus
- An approach to overcome division by zero in the interval Gauss algorithm
- An Interval Arithmetic Approach for the Construction of an Almost Globally Convergent Method for the Solution of the Nonlinear Poisson Equation on the Unit Square
- Block Methods for the Solution of Linear Interval Equations
- Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall-Gauss-Algorithmus bei Intervall-Hessenberg-Matrizen ohne Pivotsuche
- Eine scaling-invariante Pivotsuche für Intervallmatrizen
- scientific article; zbMATH DE number 1597553 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3521417 (Why is no real title available?)
- scientific article; zbMATH DE number 3562361 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1433445 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Interval Arithmetic in Matrix Computations, Part II
- Interval Methods for Systems of Equations
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- New techniques for the analysis of linear interval equations
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
- On overestimation produced by the interval Gaussian algorithm
- On the applicability of the interval Gaussian algorithm
- On the Convergence of Some Interval-Arithmetic Modifications of Newton’s Method
- Optimale Lösung von Intervallgleichungssystemen
- The Cholesky method for interval data
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- The hull of preconditioned interval linear equations
Cited in
(13)- An approach to overcome division by zero in the interval Gauss algorithm
- Finding an inner estimation of the solution set of a fuzzy linear system
- An estimation of algebraic solution for a complex interval linear system
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- A new approach to obtain algebraic solution of interval linear systems
- Estimation of algebraic solution by limiting the solution set of an interval linear system
- scientific article; zbMATH DE number 1639655 (Why is no real title available?)
- Interval Gaussian Elimination with Pivot Tightening
- 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
- Direct methods for linear systems with inexact input data
- On regular and singular interval systems
This page was built for publication: A contribution to the feasibility of the interval Gaussian algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811945)
