A contribution to the feasibility of the interval Gaussian algorithm
From MaRDI portal
Publication:811945
DOI10.1007/s11155-006-4876-0zbMath1086.65023OpenAlexW2067016819MaRDI QIDQ811945
Publication date: 23 January 2006
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11155-006-4876-0
interval arithmeticfeasibilitydiagonally dominant matricesinterval linear systemsinterval Gaussian algorithm
Interval and finite arithmetic (65G30) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (6)
Direct methods for linear systems with inexact input data ⋮ Estimation of algebraic solution by limiting the solution set of an interval linear system ⋮ On regular and singular interval systems ⋮ Finding an inner estimation of the solution set of a fuzzy linear system ⋮ A new approach to obtain algebraic solution of interval linear systems ⋮ An estimation of algebraic solution for a complex interval linear system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- New techniques for the analysis of linear interval equations
- Abbruch beim Intervall-Gauß-Algorithmus
- On the applicability of the interval Gaussian algorithm
- The Cholesky method for interval data
- On overestimation produced by the interval Gaussian algorithm
- The hull of preconditioned interval linear equations
- An approach to overcome division by zero in the interval Gauss algorithm
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- Eine scaling-invariante Pivotsuche für Intervallmatrizen
- Optimale Lösung von Intervallgleichungssystemen
- Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall-Gauss-Algorithmus bei Intervall-Hessenberg-Matrizen ohne Pivotsuche
- Block Methods for the Solution of Linear Interval Equations
- On the Convergence of Some Interval-Arithmetic Modifications of Newton’s Method
- 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
- Interval Methods for Systems of Equations
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- Interval Arithmetic in Matrix Computations, Part II
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
This page was built for publication: A contribution to the feasibility of the interval Gaussian algorithm
