A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
From MaRDI portal
Publication:5286283
DOI10.1137/0614029zbMATH Open0777.65012OpenAlexW2064887622MaRDI QIDQ5286283FDOQ5286283
Authors: Andreas Frommer, Günter Mayer 
Publication date: 29 June 1993
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0614029
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Interval and finite arithmetic (65G30)
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
- A contribution to the feasibility of the interval Gaussian algorithm
- Solving the full rank interval least squares problem
- An approach to overcome division by zero in the interval Gauss algorithm
- Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
- Direct methods for linear systems with inexact input data
- Interval-affine Gaussian algorthm for constrained systems
- Interval linear systems: the state of the art
- Results concerning interval linear systems with multiple right-hand sides and the interval matrix equation \(AX=B\)
- An algorithm to determine linear independence of a set of interval vectors
- Verification for existence of solutions of linear complementarity problems
This page was built for publication: A New Criterion to Guarantee 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 Q5286283)
