A Contribution to the Feasibility of the Interval Gaussian Algorithm
Author:
- 1 April 2006
- journal article
- Published by Springer Nature in Reliable Computing
- Vol. 12 (2) , 79-98
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A Feasibility Result for Interval Gaussian Elimination Relying on Graph Structure2001
- Linear systems with Ω-diagonally dominant matrices and related onesLinear Algebra and its Applications, 1993
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian AlgorithmSIAM Journal on Matrix Analysis and Applications, 1993
- Block Methods for the Solution of Linear Interval EquationsSIAM Journal on Matrix Analysis and Applications, 1990
- An Interval Arithmetic Approach for the Construction of an Almost Globally Convergent Method for the Solution of the Nonlinear Poisson Equation on the Unit SquareSIAM Journal on Scientific and Statistical Computing, 1984
- On the Convergence of Some Interval-Arithmetic Modifications of Newton’s MethodSIAM Journal on Numerical Analysis, 1984
- New techniques for the analysis of linear interval equationsLinear Algebra and its Applications, 1984
- Über die Durchführbarkeit des Gaußschen Algorithmus bei Gleichungen mit Intervallen als Koeffizienten1977
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel IterationsSIAM Journal on Numerical Analysis, 1972
- Interval Arithmetic in Matrix Computations, Part IISIAM Journal on Numerical Analysis, 1967