A contribution to the feasibility of the interval Gaussian algorithm
From MaRDI portal
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
- 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?)
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- Abbruch beim Intervall-Gauß-Algorithmus
- 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
- An approach to overcome division by zero in the interval Gauss algorithm
- 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
- 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 Convergence of Some Interval-Arithmetic Modifications of Newton’s Method
- On the applicability of the interval Gaussian algorithm
- 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
(12)- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- An approach to overcome division by zero in the interval Gauss algorithm
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- A new approach to obtain algebraic solution of interval linear systems
- Direct methods for linear systems with inexact input data
- Estimation of algebraic solution by limiting the solution set of an interval linear system
- Finding an inner estimation of the solution set of a fuzzy linear system
- An estimation of algebraic solution for a complex interval linear system
- On regular and singular interval systems
- Interval Gaussian Elimination with Pivot Tightening
- scientific article; zbMATH DE number 1639655 (Why is no real title available?)
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)
